./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f 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/substring-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 0116566dfd4e4e63b59200ee97d098541aa6c54d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 21:57:34,179 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 21:57:34,181 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 21:57:34,193 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 21:57:34,193 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 21:57:34,194 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 21:57:34,195 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 21:57:34,197 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 21:57:34,199 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 21:57:34,200 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 21:57:34,201 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 21:57:34,201 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 21:57:34,202 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 21:57:34,203 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 21:57:34,204 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 21:57:34,205 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 21:57:34,206 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 21:57:34,208 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 21:57:34,210 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 21:57:34,211 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 21:57:34,213 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 21:57:34,214 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 21:57:34,217 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 21:57:34,217 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 21:57:34,217 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 21:57:34,218 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 21:57:34,219 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 21:57:34,220 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 21:57:34,221 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 21:57:34,222 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 21:57:34,222 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 21:57:34,223 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 21:57:34,223 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 21:57:34,223 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 21:57:34,224 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 21:57:34,225 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 21:57:34,225 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 21:57:34,245 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 21:57:34,246 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 21:57:34,247 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 21:57:34,247 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 21:57:34,247 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 21:57:34,247 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 21:57:34,248 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 21:57:34,250 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 21:57:34,250 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 21:57:34,250 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 21:57:34,250 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 21:57:34,250 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 21:57:34,251 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 21:57:34,251 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 21:57:34,251 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 21:57:34,251 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 21:57:34,251 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 21:57:34,251 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 21:57:34,252 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 21:57:34,252 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 21:57:34,252 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 21:57:34,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:57:34,252 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 21:57:34,253 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 21:57:34,254 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 21:57:34,254 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 21:57:34,254 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 -> 0116566dfd4e4e63b59200ee97d098541aa6c54d [2019-01-13 21:57:34,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 21:57:34,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 21:57:34,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 21:57:34,331 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 21:57:34,331 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 21:57:34,332 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:57:34,395 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/033ccc03c/1837df4d5a8f4a1885e8cdd190b44732/FLAGc450a2e08 [2019-01-13 21:57:34,838 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 21:57:34,838 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:57:34,854 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/033ccc03c/1837df4d5a8f4a1885e8cdd190b44732/FLAGc450a2e08 [2019-01-13 21:57:35,180 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/033ccc03c/1837df4d5a8f4a1885e8cdd190b44732 [2019-01-13 21:57:35,184 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 21:57:35,186 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 21:57:35,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 21:57:35,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 21:57:35,191 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 21:57:35,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:57:35" (1/1) ... [2019-01-13 21:57:35,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11357ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:35, skipping insertion in model container [2019-01-13 21:57:35,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:57:35" (1/1) ... [2019-01-13 21:57:35,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 21:57:35,262 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 21:57:35,606 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:57:35,620 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 21:57:35,775 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:57:35,844 INFO L195 MainTranslator]: Completed translation [2019-01-13 21:57:35,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:35 WrapperNode [2019-01-13 21:57:35,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 21:57:35,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 21:57:35,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 21:57:35,845 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 21:57:35,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:35" (1/1) ... [2019-01-13 21:57:35,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:35" (1/1) ... [2019-01-13 21:57:35,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:35" (1/1) ... [2019-01-13 21:57:35,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:35" (1/1) ... [2019-01-13 21:57:35,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:35" (1/1) ... [2019-01-13 21:57:35,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:35" (1/1) ... [2019-01-13 21:57:35,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:35" (1/1) ... [2019-01-13 21:57:35,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 21:57:35,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 21:57:35,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 21:57:35,928 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 21:57:35,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:35" (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 [2019-01-13 21:57:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 21:57:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 21:57:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 21:57:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 21:57:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure substring [2019-01-13 21:57:35,993 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 21:57:35,993 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 21:57:35,993 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 21:57:35,993 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 21:57:35,993 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 21:57:35,993 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 21:57:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 21:57:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 21:57:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 21:57:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 21:57:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 21:57:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 21:57:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 21:57:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 21:57:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 21:57:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 21:57:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 21:57:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 21:57:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 21:57:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 21:57:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 21:57:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 21:57:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 21:57:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 21:57:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 21:57:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 21:57:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 21:57:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 21:57:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 21:57:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 21:57:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 21:57:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 21:57:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 21:57:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 21:57:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 21:57:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 21:57:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 21:57:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 21:57:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 21:57:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 21:57:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 21:57:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 21:57:36,001 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 21:57:36,001 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 21:57:36,001 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 21:57:36,001 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 21:57:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 21:57:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 21:57:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 21:57:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 21:57:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 21:57:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 21:57:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 21:57:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 21:57:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 21:57:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 21:57:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 21:57:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 21:57:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 21:57:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 21:57:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 21:57:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 21:57:36,004 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 21:57:36,004 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 21:57:36,004 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 21:57:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 21:57:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 21:57:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 21:57:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 21:57:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 21:57:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 21:57:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 21:57:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 21:57:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 21:57:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 21:57:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 21:57:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 21:57:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 21:57:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 21:57:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 21:57:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 21:57:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 21:57:36,007 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 21:57:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 21:57:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 21:57:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 21:57:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 21:57:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 21:57:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 21:57:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 21:57:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 21:57:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 21:57:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 21:57:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 21:57:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 21:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 21:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 21:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 21:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 21:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 21:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 21:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 21:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 21:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 21:57:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure substring [2019-01-13 21:57:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 21:57:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 21:57:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 21:57:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 21:57:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 21:57:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 21:57:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 21:57:36,673 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 21:57:36,674 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 21:57:36,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:57:36 BoogieIcfgContainer [2019-01-13 21:57:36,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 21:57:36,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 21:57:36,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 21:57:36,681 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 21:57:36,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 09:57:35" (1/3) ... [2019-01-13 21:57:36,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1729d8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:57:36, skipping insertion in model container [2019-01-13 21:57:36,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:35" (2/3) ... [2019-01-13 21:57:36,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1729d8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:57:36, skipping insertion in model container [2019-01-13 21:57:36,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:57:36" (3/3) ... [2019-01-13 21:57:36,686 INFO L112 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:57:36,696 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 21:57:36,705 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-13 21:57:36,722 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-13 21:57:36,750 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 21:57:36,751 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 21:57:36,751 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 21:57:36,751 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 21:57:36,755 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 21:57:36,755 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 21:57:36,755 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 21:57:36,755 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 21:57:36,755 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 21:57:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-01-13 21:57:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:57:36,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:36,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:36,788 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:57:36,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash 386859026, now seen corresponding path program 1 times [2019-01-13 21:57:36,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:36,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:36,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:36,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:36,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:36,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:36,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:57:36,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:57:36,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:57:36,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:57:36,997 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-01-13 21:57:37,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:37,121 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2019-01-13 21:57:37,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:57:37,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 21:57:37,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:37,134 INFO L225 Difference]: With dead ends: 46 [2019-01-13 21:57:37,134 INFO L226 Difference]: Without dead ends: 43 [2019-01-13 21:57:37,137 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 [2019-01-13 21:57:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-13 21:57:37,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-13 21:57:37,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 21:57:37,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-01-13 21:57:37,174 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 10 [2019-01-13 21:57:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:37,175 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-01-13 21:57:37,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:57:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-01-13 21:57:37,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:57:37,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:37,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:37,176 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:57:37,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:37,177 INFO L82 PathProgramCache]: Analyzing trace with hash 386859027, now seen corresponding path program 1 times [2019-01-13 21:57:37,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:37,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:37,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:37,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:37,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:37,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:37,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:57:37,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:57:37,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:57:37,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:37,308 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2019-01-13 21:57:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:37,400 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-01-13 21:57:37,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:57:37,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 21:57:37,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:37,403 INFO L225 Difference]: With dead ends: 42 [2019-01-13 21:57:37,403 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 21:57:37,405 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 [2019-01-13 21:57:37,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 21:57:37,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-13 21:57:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-13 21:57:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-01-13 21:57:37,416 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 10 [2019-01-13 21:57:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:37,416 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-01-13 21:57:37,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:57:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-01-13 21:57:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:57:37,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:37,417 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:37,420 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:57:37,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:37,422 INFO L82 PathProgramCache]: Analyzing trace with hash -892272091, now seen corresponding path program 1 times [2019-01-13 21:57:37,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:37,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:37,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:37,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:37,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:37,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:37,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:57:37,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:57:37,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:57:37,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:57:37,487 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2019-01-13 21:57:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:37,561 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-01-13 21:57:37,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:57:37,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 21:57:37,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:37,564 INFO L225 Difference]: With dead ends: 41 [2019-01-13 21:57:37,564 INFO L226 Difference]: Without dead ends: 41 [2019-01-13 21:57:37,565 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 [2019-01-13 21:57:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-13 21:57:37,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-13 21:57:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-13 21:57:37,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-01-13 21:57:37,571 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 11 [2019-01-13 21:57:37,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:37,571 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-01-13 21:57:37,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:57:37,571 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-01-13 21:57:37,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:57:37,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:37,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:37,572 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:57:37,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:37,575 INFO L82 PathProgramCache]: Analyzing trace with hash -892272090, now seen corresponding path program 1 times [2019-01-13 21:57:37,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:37,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:37,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:37,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:37,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:37,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:37,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:57:37,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:57:37,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:57:37,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:37,675 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2019-01-13 21:57:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:37,765 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-01-13 21:57:37,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:57:37,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-13 21:57:37,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:37,768 INFO L225 Difference]: With dead ends: 40 [2019-01-13 21:57:37,768 INFO L226 Difference]: Without dead ends: 40 [2019-01-13 21:57:37,769 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 [2019-01-13 21:57:37,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-13 21:57:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-13 21:57:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-13 21:57:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-01-13 21:57:37,777 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 11 [2019-01-13 21:57:37,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:37,777 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-13 21:57:37,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:57:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-01-13 21:57:37,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 21:57:37,780 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:37,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:37,780 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:57:37,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:37,780 INFO L82 PathProgramCache]: Analyzing trace with hash -125213255, now seen corresponding path program 1 times [2019-01-13 21:57:37,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:37,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:37,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:37,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:37,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:37,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:37,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:57:37,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:57:37,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:57:37,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:57:37,880 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 5 states. [2019-01-13 21:57:38,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:38,279 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-01-13 21:57:38,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:57:38,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-13 21:57:38,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:38,281 INFO L225 Difference]: With dead ends: 39 [2019-01-13 21:57:38,281 INFO L226 Difference]: Without dead ends: 39 [2019-01-13 21:57:38,282 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 [2019-01-13 21:57:38,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-13 21:57:38,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-13 21:57:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-13 21:57:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-01-13 21:57:38,297 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 14 [2019-01-13 21:57:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:38,297 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-01-13 21:57:38,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:57:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-01-13 21:57:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 21:57:38,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:38,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:38,299 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:57:38,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:38,299 INFO L82 PathProgramCache]: Analyzing trace with hash -125213254, now seen corresponding path program 1 times [2019-01-13 21:57:38,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:38,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:38,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:38,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:38,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:38,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:38,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:57:38,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:57:38,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:57:38,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:57:38,527 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 7 states. [2019-01-13 21:57:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:38,741 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2019-01-13 21:57:38,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:57:38,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-01-13 21:57:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:38,746 INFO L225 Difference]: With dead ends: 61 [2019-01-13 21:57:38,747 INFO L226 Difference]: Without dead ends: 61 [2019-01-13 21:57:38,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:57:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-13 21:57:38,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 40. [2019-01-13 21:57:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-13 21:57:38,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-01-13 21:57:38,754 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2019-01-13 21:57:38,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:38,754 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-13 21:57:38,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:57:38,754 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-01-13 21:57:38,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 21:57:38,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:38,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:38,756 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:57:38,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:38,756 INFO L82 PathProgramCache]: Analyzing trace with hash -70853378, now seen corresponding path program 1 times [2019-01-13 21:57:38,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:38,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:38,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:38,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:38,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:38,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:38,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 21:57:38,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:57:38,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:57:38,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:57:38,835 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 6 states. [2019-01-13 21:57:39,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:39,008 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-01-13 21:57:39,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:57:39,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-01-13 21:57:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:39,010 INFO L225 Difference]: With dead ends: 41 [2019-01-13 21:57:39,010 INFO L226 Difference]: Without dead ends: 41 [2019-01-13 21:57:39,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:57:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-13 21:57:39,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2019-01-13 21:57:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-13 21:57:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-01-13 21:57:39,015 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 16 [2019-01-13 21:57:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:39,016 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-01-13 21:57:39,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:57:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-01-13 21:57:39,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 21:57:39,017 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:39,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:39,017 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:57:39,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:39,017 INFO L82 PathProgramCache]: Analyzing trace with hash -70853377, now seen corresponding path program 1 times [2019-01-13 21:57:39,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:39,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:39,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:39,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:39,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:39,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:39,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:57:39,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:57:39,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:57:39,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:57:39,175 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 8 states. [2019-01-13 21:57:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:39,407 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-01-13 21:57:39,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:57:39,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-13 21:57:39,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:39,408 INFO L225 Difference]: With dead ends: 54 [2019-01-13 21:57:39,408 INFO L226 Difference]: Without dead ends: 54 [2019-01-13 21:57:39,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:57:39,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-13 21:57:39,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-01-13 21:57:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-13 21:57:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-01-13 21:57:39,414 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 16 [2019-01-13 21:57:39,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:39,415 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-01-13 21:57:39,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:57:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2019-01-13 21:57:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:57:39,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:39,416 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] [2019-01-13 21:57:39,416 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:57:39,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:39,417 INFO L82 PathProgramCache]: Analyzing trace with hash -779049943, now seen corresponding path program 1 times [2019-01-13 21:57:39,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:39,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:39,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:39,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:39,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:39,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:39,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:39,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:57:39,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:57:39,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:57:39,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:39,504 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 4 states. [2019-01-13 21:57:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:39,591 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-01-13 21:57:39,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:57:39,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-01-13 21:57:39,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:39,592 INFO L225 Difference]: With dead ends: 44 [2019-01-13 21:57:39,592 INFO L226 Difference]: Without dead ends: 39 [2019-01-13 21:57:39,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-13 21:57:39,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-13 21:57:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-13 21:57:39,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-01-13 21:57:39,598 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 20 [2019-01-13 21:57:39,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:39,598 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-01-13 21:57:39,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:57:39,598 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-01-13 21:57:39,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:57:39,599 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:39,599 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] [2019-01-13 21:57:39,599 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:57:39,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:39,600 INFO L82 PathProgramCache]: Analyzing trace with hash -755130684, now seen corresponding path program 1 times [2019-01-13 21:57:39,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:39,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:39,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:39,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:39,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:39,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:39,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 21:57:39,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:57:39,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:57:39,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:57:39,821 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 6 states. [2019-01-13 21:57:39,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:39,918 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-01-13 21:57:39,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:57:39,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-13 21:57:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:39,922 INFO L225 Difference]: With dead ends: 39 [2019-01-13 21:57:39,922 INFO L226 Difference]: Without dead ends: 39 [2019-01-13 21:57:39,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:57:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-13 21:57:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-01-13 21:57:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-13 21:57:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-01-13 21:57:39,926 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 20 [2019-01-13 21:57:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:39,927 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-01-13 21:57:39,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:57:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-01-13 21:57:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:57:39,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:39,928 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] [2019-01-13 21:57:39,928 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:57:39,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:39,929 INFO L82 PathProgramCache]: Analyzing trace with hash -755130683, now seen corresponding path program 1 times [2019-01-13 21:57:39,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:39,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:39,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:39,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:39,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:40,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:40,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:40,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:57:40,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:57:40,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:57:40,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:57:40,039 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2019-01-13 21:57:40,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:40,333 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2019-01-13 21:57:40,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 21:57:40,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-01-13 21:57:40,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:40,335 INFO L225 Difference]: With dead ends: 64 [2019-01-13 21:57:40,335 INFO L226 Difference]: Without dead ends: 64 [2019-01-13 21:57:40,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-13 21:57:40,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-13 21:57:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 44. [2019-01-13 21:57:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-13 21:57:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-01-13 21:57:40,340 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 20 [2019-01-13 21:57:40,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:40,340 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-01-13 21:57:40,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:57:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-01-13 21:57:40,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:57:40,341 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:40,341 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] [2019-01-13 21:57:40,341 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:57:40,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:40,342 INFO L82 PathProgramCache]: Analyzing trace with hash -755121610, now seen corresponding path program 1 times [2019-01-13 21:57:40,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:40,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:40,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:40,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:40,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:40,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:40,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:57:40,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:57:40,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:57:40,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:57:40,408 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2019-01-13 21:57:40,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:40,489 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-01-13 21:57:40,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:57:40,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-13 21:57:40,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:40,490 INFO L225 Difference]: With dead ends: 46 [2019-01-13 21:57:40,491 INFO L226 Difference]: Without dead ends: 46 [2019-01-13 21:57:40,491 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 [2019-01-13 21:57:40,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-13 21:57:40,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-13 21:57:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-13 21:57:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-01-13 21:57:40,496 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 20 [2019-01-13 21:57:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:40,497 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-01-13 21:57:40,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:57:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-01-13 21:57:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 21:57:40,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:40,498 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] [2019-01-13 21:57:40,498 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:57:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:40,499 INFO L82 PathProgramCache]: Analyzing trace with hash 177570790, now seen corresponding path program 1 times [2019-01-13 21:57:40,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:40,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:40,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:40,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:40,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:40,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:40,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:57:40,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:57:40,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:57:40,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:57:40,844 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 6 states. [2019-01-13 21:57:40,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:40,979 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-01-13 21:57:40,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:57:40,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-01-13 21:57:40,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:40,981 INFO L225 Difference]: With dead ends: 50 [2019-01-13 21:57:40,981 INFO L226 Difference]: Without dead ends: 47 [2019-01-13 21:57:40,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:57:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-13 21:57:40,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-01-13 21:57:40,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-13 21:57:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-01-13 21:57:40,991 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2019-01-13 21:57:40,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:40,991 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-01-13 21:57:40,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:57:40,992 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-01-13 21:57:40,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 21:57:40,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:40,993 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] [2019-01-13 21:57:40,995 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:57:40,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:40,995 INFO L82 PathProgramCache]: Analyzing trace with hash 940519430, now seen corresponding path program 1 times [2019-01-13 21:57:40,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:40,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:40,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:40,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:40,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:41,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:41,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 21:57:41,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 21:57:41,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 21:57:41,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:57:41,171 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 10 states. [2019-01-13 21:57:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:41,502 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-01-13 21:57:41,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 21:57:41,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-01-13 21:57:41,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:41,504 INFO L225 Difference]: With dead ends: 56 [2019-01-13 21:57:41,504 INFO L226 Difference]: Without dead ends: 46 [2019-01-13 21:57:41,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-13 21:57:41,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-13 21:57:41,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-13 21:57:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-13 21:57:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2019-01-13 21:57:41,510 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 23 [2019-01-13 21:57:41,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:41,511 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-01-13 21:57:41,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 21:57:41,512 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2019-01-13 21:57:41,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 21:57:41,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:41,513 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] [2019-01-13 21:57:41,513 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:57:41,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:41,513 INFO L82 PathProgramCache]: Analyzing trace with hash -80548924, now seen corresponding path program 1 times [2019-01-13 21:57:41,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:41,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:41,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:41,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:41,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:41,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:41,940 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 [2019-01-13 21:57:41,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:42,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:42,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-01-13 21:57:42,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:42,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:42,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-13 21:57:42,424 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 11 treesize of output 8 [2019-01-13 21:57:42,428 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 [2019-01-13 21:57:42,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:42,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:42,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:42,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-01-13 21:57:42,511 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 22 treesize of output 23 [2019-01-13 21:57:42,517 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 [2019-01-13 21:57:42,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:42,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:42,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:42,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2019-01-13 21:57:45,338 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 30 [2019-01-13 21:57:45,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2019-01-13 21:57:45,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2019-01-13 21:57:45,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:45,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2019-01-13 21:57:45,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:45,657 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 30 treesize of output 23 [2019-01-13 21:57:45,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:45,712 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 34 treesize of output 24 [2019-01-13 21:57:45,713 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:45,798 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 [2019-01-13 21:57:45,798 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:45,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2019-01-13 21:57:45,859 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:45,936 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 34 treesize of output 26 [2019-01-13 21:57:45,937 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:45,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2019-01-13 21:57:45,988 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:46,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:57:46,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:46,057 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:44, output treesize:8 [2019-01-13 21:57:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:46,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 21:57:46,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 25 [2019-01-13 21:57:46,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-13 21:57:46,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-13 21:57:46,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2019-01-13 21:57:46,170 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 25 states. [2019-01-13 21:57:48,544 WARN L181 SmtUtils]: Spent 1.84 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-13 21:57:52,621 WARN L181 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 49 [2019-01-13 21:57:58,829 WARN L181 SmtUtils]: Spent 6.07 s on a formula simplification that was a NOOP. DAG size: 67 [2019-01-13 21:58:11,063 WARN L181 SmtUtils]: Spent 12.13 s on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-01-13 21:58:24,437 WARN L181 SmtUtils]: Spent 13.23 s on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-01-13 21:58:34,995 WARN L181 SmtUtils]: Spent 10.45 s on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-01-13 21:58:47,309 WARN L181 SmtUtils]: Spent 12.16 s on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-01-13 21:58:59,536 WARN L181 SmtUtils]: Spent 12.18 s on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-01-13 21:59:11,747 WARN L181 SmtUtils]: Spent 12.15 s on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-01-13 21:59:17,873 WARN L181 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 67 [2019-01-13 21:59:20,863 WARN L181 SmtUtils]: Spent 2.86 s on a formula simplification that was a NOOP. DAG size: 58 [2019-01-13 21:59:22,570 WARN L181 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 49 [2019-01-13 21:59:24,665 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 52 [2019-01-13 21:59:26,766 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 55 [2019-01-13 21:59:27,132 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-13 21:59:28,437 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 47 [2019-01-13 21:59:29,683 WARN L181 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 49 [2019-01-13 21:59:30,995 WARN L181 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 40 [2019-01-13 21:59:31,251 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-13 21:59:31,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:59:31,295 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2019-01-13 21:59:31,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-13 21:59:31,304 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 23 [2019-01-13 21:59:31,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:59:31,306 INFO L225 Difference]: With dead ends: 132 [2019-01-13 21:59:31,306 INFO L226 Difference]: Without dead ends: 128 [2019-01-13 21:59:31,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 107.6s TimeCoverageRelationStatistics Valid=506, Invalid=2686, Unknown=0, NotChecked=0, Total=3192 [2019-01-13 21:59:31,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-01-13 21:59:31,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 68. [2019-01-13 21:59:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-13 21:59:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2019-01-13 21:59:31,320 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 23 [2019-01-13 21:59:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:59:31,321 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2019-01-13 21:59:31,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-13 21:59:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2019-01-13 21:59:31,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-13 21:59:31,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:59:31,324 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] [2019-01-13 21:59:31,324 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:59:31,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:59:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash -98139660, now seen corresponding path program 1 times [2019-01-13 21:59:31,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:59:31,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:59:31,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:59:31,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:59:31,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:59:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:59:31,818 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 12 [2019-01-13 21:59:31,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:59:31,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:59:31,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 21:59:31,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:59:31,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:59:31,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:59:31,878 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 8 states. [2019-01-13 21:59:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:59:31,974 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-01-13 21:59:31,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 21:59:31,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-01-13 21:59:31,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:59:31,978 INFO L225 Difference]: With dead ends: 61 [2019-01-13 21:59:31,978 INFO L226 Difference]: Without dead ends: 53 [2019-01-13 21:59:31,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-13 21:59:31,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-13 21:59:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-13 21:59:31,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-13 21:59:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-01-13 21:59:31,981 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 25 [2019-01-13 21:59:31,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:59:31,981 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-01-13 21:59:31,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:59:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-01-13 21:59:31,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-13 21:59:31,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:59:31,982 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] [2019-01-13 21:59:31,983 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:59:31,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:59:31,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1787083402, now seen corresponding path program 1 times [2019-01-13 21:59:31,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:59:31,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:59:31,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:59:31,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:59:31,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:59:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:59:32,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:59:32,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:59:32,214 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 [2019-01-13 21:59:32,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:59:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:59:32,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:59:32,271 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 [2019-01-13 21:59:32,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:32,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:32,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-13 21:59:32,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-13 21:59:32,305 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 [2019-01-13 21:59:32,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:32,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:32,319 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. [2019-01-13 21:59:32,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-01-13 21:59:32,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-13 21:59:32,358 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 [2019-01-13 21:59:32,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:32,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:32,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-13 21:59:32,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-01-13 21:59:32,547 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 28 treesize of output 26 [2019-01-13 21:59:32,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2019-01-13 21:59:32,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:59:32,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2019-01-13 21:59:32,721 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:32,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:59:32,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:59:32,810 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2019-01-13 21:59:32,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:59:32,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:59:32,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-01-13 21:59:32,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 21:59:32,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 21:59:32,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-01-13 21:59:32,902 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 17 states. [2019-01-13 21:59:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:59:33,876 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2019-01-13 21:59:33,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 21:59:33,877 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-01-13 21:59:33,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:59:33,878 INFO L225 Difference]: With dead ends: 110 [2019-01-13 21:59:33,879 INFO L226 Difference]: Without dead ends: 110 [2019-01-13 21:59:33,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2019-01-13 21:59:33,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-13 21:59:33,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 73. [2019-01-13 21:59:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-13 21:59:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2019-01-13 21:59:33,892 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 25 [2019-01-13 21:59:33,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:59:33,892 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2019-01-13 21:59:33,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 21:59:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2019-01-13 21:59:33,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 21:59:33,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:59:33,893 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, 1, 1] [2019-01-13 21:59:33,893 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:59:33,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:59:33,894 INFO L82 PathProgramCache]: Analyzing trace with hash 633122316, now seen corresponding path program 1 times [2019-01-13 21:59:33,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:59:33,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:59:33,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:59:33,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:59:33,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:59:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:59:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:59:34,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:59:34,458 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 [2019-01-13 21:59:34,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:59:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:59:34,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:59:34,515 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 [2019-01-13 21:59:34,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:34,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:34,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-13 21:59:34,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-13 21:59:34,561 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 [2019-01-13 21:59:34,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:34,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:34,580 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. [2019-01-13 21:59:34,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-01-13 21:59:34,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-13 21:59:34,623 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 [2019-01-13 21:59:34,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:34,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:34,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-13 21:59:34,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-01-13 21:59:35,978 WARN L181 SmtUtils]: Spent 947.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-13 21:59:36,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2019-01-13 21:59:36,123 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 45 treesize of output 37 [2019-01-13 21:59:36,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:36,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2019-01-13 21:59:36,210 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-13 21:59:36,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2019-01-13 21:59:36,324 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-13 21:59:36,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-01-13 21:59:36,445 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:36,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2019-01-13 21:59:36,561 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:36,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2019-01-13 21:59:36,569 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:36,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-01-13 21:59:36,574 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:36,680 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 27 treesize of output 19 [2019-01-13 21:59:36,681 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:36,685 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 31 treesize of output 23 [2019-01-13 21:59:36,686 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:36,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2019-01-13 21:59:36,784 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2019-01-13 21:59:36,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2019-01-13 21:59:37,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:59:37,054 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2019-01-13 21:59:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:59:37,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:59:37,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2019-01-13 21:59:37,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-13 21:59:37,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-13 21:59:37,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702 [2019-01-13 21:59:37,343 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand 27 states. [2019-01-13 21:59:38,518 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-01-13 21:59:39,020 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2019-01-13 21:59:39,294 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 68 [2019-01-13 21:59:39,551 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 74 [2019-01-13 21:59:39,783 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 76 [2019-01-13 21:59:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:59:42,556 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2019-01-13 21:59:42,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-13 21:59:42,557 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-01-13 21:59:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:59:42,558 INFO L225 Difference]: With dead ends: 86 [2019-01-13 21:59:42,559 INFO L226 Difference]: Without dead ends: 86 [2019-01-13 21:59:42,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=264, Invalid=1457, Unknown=1, NotChecked=0, Total=1722 [2019-01-13 21:59:42,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-13 21:59:42,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2019-01-13 21:59:42,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-13 21:59:42,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2019-01-13 21:59:42,564 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 27 [2019-01-13 21:59:42,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:59:42,564 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2019-01-13 21:59:42,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-13 21:59:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2019-01-13 21:59:42,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 21:59:42,565 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:59:42,565 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, 1, 1] [2019-01-13 21:59:42,569 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:59:42,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:59:42,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2145519455, now seen corresponding path program 1 times [2019-01-13 21:59:42,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:59:42,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:59:42,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:59:42,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:59:42,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:59:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:59:42,971 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-13 21:59:43,196 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-13 21:59:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:59:43,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:59:43,488 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 [2019-01-13 21:59:43,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:59:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:59:43,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:59:43,547 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 [2019-01-13 21:59:43,628 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 [2019-01-13 21:59:43,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:59:43,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:59:43,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:43,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-13 21:59:43,673 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 15 treesize of output 12 [2019-01-13 21:59:43,675 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 [2019-01-13 21:59:43,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:43,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:43,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:43,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-13 21:59:43,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-13 21:59:43,833 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 [2019-01-13 21:59:43,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:59:43,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:59:43,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:59:43,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2019-01-13 21:59:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:59:43,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:59:43,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-01-13 21:59:43,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-13 21:59:43,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-13 21:59:43,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-01-13 21:59:43,990 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand 21 states. [2019-01-13 21:59:44,941 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-01-13 21:59:45,418 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-01-13 21:59:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:59:45,935 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2019-01-13 21:59:45,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 21:59:45,936 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-01-13 21:59:45,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:59:45,938 INFO L225 Difference]: With dead ends: 86 [2019-01-13 21:59:45,938 INFO L226 Difference]: Without dead ends: 84 [2019-01-13 21:59:45,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2019-01-13 21:59:45,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-13 21:59:45,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 50. [2019-01-13 21:59:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-13 21:59:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-01-13 21:59:45,942 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 30 [2019-01-13 21:59:45,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:59:45,942 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-01-13 21:59:45,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-13 21:59:45,942 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-01-13 21:59:45,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-13 21:59:45,943 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:59:45,943 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:59:45,943 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:59:45,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:59:45,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1646280319, now seen corresponding path program 1 times [2019-01-13 21:59:45,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:59:45,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:59:45,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:59:45,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:59:45,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:59:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:59:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:59:46,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:59:46,274 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:59:46,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:59:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:59:46,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:59:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:59:46,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:59:46,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-01-13 21:59:46,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 21:59:46,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 21:59:46,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:59:46,350 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2019-01-13 21:59:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:59:46,492 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-01-13 21:59:46,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 21:59:46,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-01-13 21:59:46,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:59:46,494 INFO L225 Difference]: With dead ends: 63 [2019-01-13 21:59:46,494 INFO L226 Difference]: Without dead ends: 63 [2019-01-13 21:59:46,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-01-13 21:59:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-13 21:59:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2019-01-13 21:59:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-13 21:59:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-01-13 21:59:46,498 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 31 [2019-01-13 21:59:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:59:46,498 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-01-13 21:59:46,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 21:59:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-01-13 21:59:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-13 21:59:46,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:59:46,499 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, 1, 1] [2019-01-13 21:59:46,499 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 21:59:46,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:59:46,500 INFO L82 PathProgramCache]: Analyzing trace with hash 649894181, now seen corresponding path program 2 times [2019-01-13 21:59:46,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:59:46,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:59:46,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:59:46,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:59:46,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:59:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:59:47,079 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:59:47,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:59:47,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:59:47,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:59:47,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:59:47,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:59:47,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:59:47,233 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 [2019-01-13 21:59:47,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:47,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:47,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-13 21:59:47,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-13 21:59:47,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-01-13 21:59:47,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:47,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:47,279 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. [2019-01-13 21:59:47,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-13 21:59:47,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-13 21:59:47,334 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 [2019-01-13 21:59:47,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:47,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:47,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-13 21:59:47,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:38 [2019-01-13 21:59:48,855 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 47 [2019-01-13 21:59:49,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 61 [2019-01-13 21:59:49,028 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 53 treesize of output 46 [2019-01-13 21:59:49,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:49,106 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 45 treesize of output 37 [2019-01-13 21:59:49,107 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:49,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:59:49,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 54 [2019-01-13 21:59:49,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-13 21:59:49,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:59:49,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 64 [2019-01-13 21:59:49,441 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2019-01-13 21:59:49,633 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 42 treesize of output 34 [2019-01-13 21:59:49,634 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:49,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2019-01-13 21:59:49,803 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:49,807 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 36 treesize of output 28 [2019-01-13 21:59:49,807 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:49,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:59:49,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 43 [2019-01-13 21:59:49,923 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2019-01-13 21:59:50,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2019-01-13 21:59:50,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:59:50,238 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:72, output treesize:81 [2019-01-13 21:59:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:59:50,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:59:50,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2019-01-13 21:59:50,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-13 21:59:50,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-13 21:59:50,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2019-01-13 21:59:50,490 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 30 states. [2019-01-13 21:59:51,382 WARN L181 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-01-13 21:59:51,604 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-01-13 21:59:54,429 WARN L181 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-01-13 21:59:58,839 WARN L181 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-01-13 22:00:03,878 WARN L181 SmtUtils]: Spent 4.94 s on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-01-13 22:00:14,141 WARN L181 SmtUtils]: Spent 9.95 s on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2019-01-13 22:00:22,592 WARN L181 SmtUtils]: Spent 8.34 s on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-01-13 22:00:27,913 WARN L181 SmtUtils]: Spent 5.22 s on a formula simplification. DAG size of input: 118 DAG size of output: 92 [2019-01-13 22:00:32,408 WARN L181 SmtUtils]: Spent 4.41 s on a formula simplification. DAG size of input: 131 DAG size of output: 96 [2019-01-13 22:00:38,272 WARN L181 SmtUtils]: Spent 5.17 s on a formula simplification. DAG size of input: 130 DAG size of output: 97 [2019-01-13 22:00:44,528 WARN L181 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-01-13 22:00:45,851 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-01-13 22:00:50,877 WARN L181 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-01-13 22:00:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:00:51,499 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-01-13 22:00:51,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-13 22:00:51,500 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2019-01-13 22:00:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:00:51,502 INFO L225 Difference]: With dead ends: 77 [2019-01-13 22:00:51,502 INFO L226 Difference]: Without dead ends: 77 [2019-01-13 22:00:51,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 58.1s TimeCoverageRelationStatistics Valid=303, Invalid=2049, Unknown=0, NotChecked=0, Total=2352 [2019-01-13 22:00:51,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-13 22:00:51,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2019-01-13 22:00:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-13 22:00:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-01-13 22:00:51,507 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 34 [2019-01-13 22:00:51,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:00:51,510 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-01-13 22:00:51,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-13 22:00:51,510 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-01-13 22:00:51,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-13 22:00:51,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:00:51,511 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:00:51,512 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 22:00:51,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:00:51,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1760882810, now seen corresponding path program 2 times [2019-01-13 22:00:51,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:00:51,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:00:51,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:00:51,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:00:51,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:00:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:00:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:00:51,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:00:51,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:00:51,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:00:51,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 22:00:51,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:00:51,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:00:51,925 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 [2019-01-13 22:00:51,933 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 [2019-01-13 22:00:51,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:00:51,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:00:51,950 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 [2019-01-13 22:00:51,950 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:00:51,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:00:51,956 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-13 22:00:51,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 22:00:51,982 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 [2019-01-13 22:00:51,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:00:51,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:00:51,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:00:51,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-01-13 22:00:52,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-13 22:00:52,027 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 [2019-01-13 22:00:52,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:00:52,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:00:52,046 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. [2019-01-13 22:00:52,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-01-13 22:00:52,228 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 32 treesize of output 30 [2019-01-13 22:00:52,231 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 [2019-01-13 22:00:52,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:00:52,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 22:00:52,247 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 22:00:52,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 22:00:52,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-13 22:00:52,267 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:33 [2019-01-13 22:00:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:00:52,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:00:52,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2019-01-13 22:00:52,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-13 22:00:52,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-13 22:00:52,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-01-13 22:00:52,394 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 18 states. [2019-01-13 22:00:54,686 WARN L181 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-01-13 22:00:55,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:00:55,277 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-01-13 22:00:55,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 22:00:55,281 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2019-01-13 22:00:55,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:00:55,282 INFO L225 Difference]: With dead ends: 78 [2019-01-13 22:00:55,282 INFO L226 Difference]: Without dead ends: 78 [2019-01-13 22:00:55,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2019-01-13 22:00:55,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-13 22:00:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 46. [2019-01-13 22:00:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-13 22:00:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-01-13 22:00:55,287 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 36 [2019-01-13 22:00:55,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:00:55,288 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-01-13 22:00:55,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-13 22:00:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-01-13 22:00:55,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 22:00:55,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:00:55,289 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:00:55,289 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 22:00:55,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:00:55,289 INFO L82 PathProgramCache]: Analyzing trace with hash 24619024, now seen corresponding path program 1 times [2019-01-13 22:00:55,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:00:55,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:00:55,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:00:55,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:00:55,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:00:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:00:55,496 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-13 22:00:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:00:55,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:00:55,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:00:55,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:00:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:00:55,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:00:55,977 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 [2019-01-13 22:00:55,992 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 [2019-01-13 22:00:55,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:00:56,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:00:56,278 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 [2019-01-13 22:00:56,279 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:00:56,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:00:56,405 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-13 22:00:56,433 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 [2019-01-13 22:00:56,436 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 [2019-01-13 22:00:56,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:00:56,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:00:56,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:00:56,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-13 22:00:56,479 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 [2019-01-13 22:00:56,482 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 [2019-01-13 22:00:56,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:00:56,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:00:56,498 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. [2019-01-13 22:00:56,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-13 22:00:59,182 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 37 [2019-01-13 22:00:59,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2019-01-13 22:00:59,368 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 44 treesize of output 42 [2019-01-13 22:00:59,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 22:00:59,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2019-01-13 22:00:59,484 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-13 22:00:59,625 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 29 treesize of output 21 [2019-01-13 22:00:59,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:00:59,629 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 34 treesize of output 26 [2019-01-13 22:00:59,630 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:00:59,745 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 44 treesize of output 37 [2019-01-13 22:00:59,745 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 22:00:59,895 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 37 treesize of output 27 [2019-01-13 22:00:59,896 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 22:01:00,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2019-01-13 22:01:00,006 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 22:01:00,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2019-01-13 22:01:00,128 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2019-01-13 22:01:00,229 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 27 treesize of output 25 [2019-01-13 22:01:00,230 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2019-01-13 22:01:00,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2019-01-13 22:01:00,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-13 22:01:00,419 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:60, output treesize:86 [2019-01-13 22:01:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:01:00,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:01:00,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2019-01-13 22:01:00,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-13 22:01:00,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-13 22:01:00,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2019-01-13 22:01:00,614 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 32 states. [2019-01-13 22:01:01,587 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-01-13 22:01:01,849 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-01-13 22:01:04,311 WARN L181 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-01-13 22:01:10,947 WARN L181 SmtUtils]: Spent 6.58 s on a formula simplification. DAG size of input: 94 DAG size of output: 67 [2019-01-13 22:01:11,218 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-01-13 22:01:11,543 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 68 [2019-01-13 22:01:13,865 WARN L181 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 115 DAG size of output: 74 [2019-01-13 22:01:16,171 WARN L181 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 117 DAG size of output: 76 [2019-01-13 22:01:18,308 WARN L181 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-01-13 22:01:20,557 WARN L181 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-01-13 22:01:22,732 WARN L181 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-01-13 22:01:25,570 WARN L181 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-01-13 22:01:34,039 WARN L181 SmtUtils]: Spent 8.41 s on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-01-13 22:01:37,816 WARN L181 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-01-13 22:01:43,324 WARN L181 SmtUtils]: Spent 5.45 s on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-01-13 22:01:44,650 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-01-13 22:01:44,904 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-01-13 22:01:45,139 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-01-13 22:01:47,454 WARN L181 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2019-01-13 22:01:57,505 WARN L181 SmtUtils]: Spent 7.05 s on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-01-13 22:01:59,827 WARN L181 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2019-01-13 22:02:00,064 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-01-13 22:02:04,374 WARN L181 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-01-13 22:02:04,631 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-01-13 22:02:05,036 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-01-13 22:02:05,717 WARN L181 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-01-13 22:02:06,050 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-01-13 22:02:06,257 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-01-13 22:02:19,708 WARN L181 SmtUtils]: Spent 8.79 s on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-01-13 22:02:19,950 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-01-13 22:02:20,237 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-01-13 22:02:20,507 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-01-13 22:02:22,773 WARN L181 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-01-13 22:02:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:02:22,784 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2019-01-13 22:02:22,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-13 22:02:22,785 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-01-13 22:02:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:02:22,786 INFO L225 Difference]: With dead ends: 88 [2019-01-13 22:02:22,786 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 22:02:22,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 84.1s TimeCoverageRelationStatistics Valid=981, Invalid=4418, Unknown=3, NotChecked=0, Total=5402 [2019-01-13 22:02:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 22:02:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-13 22:02:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-13 22:02:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-13 22:02:22,790 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2019-01-13 22:02:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:02:22,790 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-13 22:02:22,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-13 22:02:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-13 22:02:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 22:02:22,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:02:22,791 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:02:22,791 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION]=== [2019-01-13 22:02:22,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:02:22,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1307856916, now seen corresponding path program 3 times [2019-01-13 22:02:22,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:02:22,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:02:22,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:02:22,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:02:22,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:02:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:02:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-13 22:02:23,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:02:23,178 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:02:23,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-13 22:02:23,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-13 22:02:23,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:02:23,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:02:23,246 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 [2019-01-13 22:02:23,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:02:23,258 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 [2019-01-13 22:02:23,269 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 [2019-01-13 22:02:23,270 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:02:23,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:02:23,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:02:23,294 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-13 22:02:23,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 22:02:23,368 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 [2019-01-13 22:02:23,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:02:23,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:02:23,388 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. [2019-01-13 22:02:23,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-13 22:02:23,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-13 22:02:23,426 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 [2019-01-13 22:02:23,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:02:23,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:02:23,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-13 22:02:23,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2019-01-13 22:02:27,036 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 37 [2019-01-13 22:02:27,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 57 [2019-01-13 22:02:27,206 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 45 treesize of output 43 [2019-01-13 22:02:27,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 22:02:27,299 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 29 treesize of output 21 [2019-01-13 22:02:27,299 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:02:27,302 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 35 treesize of output 27 [2019-01-13 22:02:27,303 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:02:27,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2019-01-13 22:02:27,376 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:02:27,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2019-01-13 22:02:27,458 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 22:02:27,536 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 28 treesize of output 26 [2019-01-13 22:02:27,537 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-13 22:02:27,618 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 41 treesize of output 31 [2019-01-13 22:02:27,619 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 22:02:27,732 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 31 treesize of output 39 [2019-01-13 22:02:27,733 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2019-01-13 22:02:27,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2019-01-13 22:02:28,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-13 22:02:28,017 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:67, output treesize:96 [2019-01-13 22:02:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-13 22:02:28,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:02:28,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-01-13 22:02:28,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-13 22:02:28,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-13 22:02:28,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2019-01-13 22:02:28,167 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 27 states. [2019-01-13 22:02:33,574 WARN L181 SmtUtils]: Spent 5.02 s on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-01-13 22:02:36,752 WARN L181 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-01-13 22:02:36,915 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-13 22:02:37,267 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-01-13 22:02:37,630 WARN L181 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-01-13 22:02:37,944 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-01-13 22:02:38,241 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-01-13 22:02:40,857 WARN L181 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-01-13 22:02:41,036 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-01-13 22:02:41,615 WARN L181 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-01-13 22:02:41,868 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-01-13 22:02:42,199 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-01-13 22:02:42,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:02:42,218 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-13 22:02:42,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-13 22:02:42,219 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 41 [2019-01-13 22:02:42,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:02:42,219 INFO L225 Difference]: With dead ends: 41 [2019-01-13 22:02:42,220 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 22:02:42,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=392, Invalid=1588, Unknown=0, NotChecked=0, Total=1980 [2019-01-13 22:02:42,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 22:02:42,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 22:02:42,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 22:02:42,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 22:02:42,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-01-13 22:02:42,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:02:42,221 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 22:02:42,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-13 22:02:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 22:02:42,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 22:02:42,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:02:42 BoogieIcfgContainer [2019-01-13 22:02:42,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:02:42,227 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:02:42,227 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:02:42,227 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:02:42,228 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:57:36" (3/4) ... [2019-01-13 22:02:42,231 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 22:02:42,236 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 22:02:42,236 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 22:02:42,237 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 22:02:42,237 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 22:02:42,237 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure substring [2019-01-13 22:02:42,242 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-01-13 22:02:42,242 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-01-13 22:02:42,242 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 22:02:42,283 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 22:02:42,283 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 22:02:42,284 INFO L168 Benchmark]: Toolchain (without parser) took 307099.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -87.8 MB). Peak memory consumption was 113.0 MB. Max. memory is 11.5 GB. [2019-01-13 22:02:42,285 INFO L168 Benchmark]: CDTParser took 0.15 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. [2019-01-13 22:02:42,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 657.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-13 22:02:42,285 INFO L168 Benchmark]: Boogie Preprocessor took 82.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:02:42,286 INFO L168 Benchmark]: RCFGBuilder took 748.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2019-01-13 22:02:42,289 INFO L168 Benchmark]: TraceAbstraction took 305549.61 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 12.5 MB). Peak memory consumption was 79.1 MB. Max. memory is 11.5 GB. [2019-01-13 22:02:42,290 INFO L168 Benchmark]: Witness Printer took 56.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-01-13 22:02:42,293 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.15 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 657.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 748.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 305549.61 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 12.5 MB). Peak memory consumption was 79.1 MB. Max. memory is 11.5 GB. * Witness Printer took 56.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: 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: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 53 locations, 15 error locations. SAFE Result, 305.4s OverallTime, 24 OverallIterations, 4 TraceHistogramMax, 276.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 629 SDtfs, 2085 SDslu, 2564 SDs, 0 SdLazy, 4453 SolverSat, 421 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 654 GetRequests, 215 SyntacticMatches, 12 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2890 ImplicationChecksByTransitivity, 282.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=17, 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, 24 MinimizatonAttempts, 255 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 27.8s InterpolantComputationTime, 822 NumberOfCodeBlocks, 822 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 789 ConstructedInterpolants, 98 QuantifiedInterpolants, 319105 SizeOfPredicates, 139 NumberOfNonLiveVariables, 1545 ConjunctsInSsa, 322 ConjunctsInUnsatCore, 33 InterpolantComputations, 16 PerfectInterpolantSequences, 35/220 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...