./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memcleanup.prp --file /storage/repos/svcomp/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version cbd82567 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/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-cbd8256-m [2018-11-28 11:50:33,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:50:33,266 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:50:33,277 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:50:33,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:50:33,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:50:33,280 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:50:33,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:50:33,283 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:50:33,284 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:50:33,285 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:50:33,285 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:50:33,286 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:50:33,287 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:50:33,288 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:50:33,289 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:50:33,290 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:50:33,291 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:50:33,294 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:50:33,295 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:50:33,296 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:50:33,297 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:50:33,300 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:50:33,300 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:50:33,300 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:50:33,301 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:50:33,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:50:33,303 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:50:33,304 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:50:33,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:50:33,305 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:50:33,306 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:50:33,306 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:50:33,306 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:50:33,307 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:50:33,308 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:50:33,308 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2018-11-28 11:50:33,323 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:50:33,324 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:50:33,324 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:50:33,324 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:50:33,325 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:50:33,325 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:50:33,325 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:50:33,326 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:50:33,326 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:50:33,326 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:50:33,326 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:50:33,326 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:50:33,327 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:50:33,327 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 11:50:33,327 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 11:50:33,327 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:50:33,327 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:50:33,327 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:50:33,328 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:50:33,328 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:50:33,328 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:50:33,328 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:50:33,328 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:50:33,328 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:50:33,329 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:50:33,329 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:50:33,329 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:50:33,329 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-memcleanup) ) 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 -> 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 [2018-11-28 11:50:33,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:50:33,375 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:50:33,379 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:50:33,380 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:50:33,381 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:50:33,381 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-28 11:50:33,437 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e444ae0d5/afc847e2db1f4e79a1690d1438260fad/FLAGbf5b114e3 [2018-11-28 11:50:33,939 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:50:33,939 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-28 11:50:33,956 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e444ae0d5/afc847e2db1f4e79a1690d1438260fad/FLAGbf5b114e3 [2018-11-28 11:50:34,238 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e444ae0d5/afc847e2db1f4e79a1690d1438260fad [2018-11-28 11:50:34,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:50:34,243 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 11:50:34,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:50:34,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:50:34,248 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:50:34,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:50:34" (1/1) ... [2018-11-28 11:50:34,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65899211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:34, skipping insertion in model container [2018-11-28 11:50:34,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:50:34" (1/1) ... [2018-11-28 11:50:34,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:50:34,327 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:50:34,733 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:50:34,750 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:50:34,883 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:50:34,959 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:50:34,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:34 WrapperNode [2018-11-28 11:50:34,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:50:34,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:50:34,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:50:34,963 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:50:34,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:34" (1/1) ... [2018-11-28 11:50:34,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:34" (1/1) ... [2018-11-28 11:50:35,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:34" (1/1) ... [2018-11-28 11:50:35,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:34" (1/1) ... [2018-11-28 11:50:35,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:34" (1/1) ... [2018-11-28 11:50:35,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:34" (1/1) ... [2018-11-28 11:50:35,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:34" (1/1) ... [2018-11-28 11:50:35,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:50:35,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:50:35,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:50:35,079 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:50:35,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:50:35,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:50:35,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:50:35,150 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 11:50:35,151 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2018-11-28 11:50:35,151 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2018-11-28 11:50:35,151 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:50:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 11:50:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 11:50:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 11:50:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 11:50:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 11:50:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 11:50:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 11:50:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 11:50:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 11:50:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 11:50:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 11:50:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 11:50:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 11:50:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 11:50:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 11:50:35,156 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 11:50:35,156 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 11:50:35,156 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 11:50:35,156 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 11:50:35,156 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 11:50:35,157 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 11:50:35,157 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 11:50:35,158 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 11:50:35,158 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 11:50:35,158 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 11:50:35,158 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 11:50:35,158 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 11:50:35,158 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 11:50:35,158 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 11:50:35,159 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 11:50:35,159 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 11:50:35,159 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 11:50:35,159 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 11:50:35,159 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 11:50:35,159 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 11:50:35,159 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 11:50:35,160 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 11:50:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 11:50:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 11:50:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 11:50:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 11:50:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 11:50:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 11:50:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 11:50:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 11:50:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 11:50:35,164 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 11:50:35,164 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 11:50:35,164 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 11:50:35,164 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 11:50:35,164 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 11:50:35,164 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 11:50:35,164 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 11:50:35,165 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 11:50:35,165 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 11:50:35,165 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 11:50:35,165 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 11:50:35,165 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 11:50:35,165 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 11:50:35,166 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 11:50:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 11:50:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 11:50:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 11:50:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 11:50:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 11:50:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 11:50:35,169 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 11:50:35,169 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 11:50:35,169 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 11:50:35,169 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 11:50:35,169 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 11:50:35,169 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 11:50:35,169 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 11:50:35,169 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 11:50:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 11:50:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 11:50:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 11:50:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 11:50:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 11:50:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 11:50:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 11:50:35,171 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 11:50:35,173 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 11:50:35,173 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 11:50:35,173 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 11:50:35,173 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 11:50:35,173 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 11:50:35,174 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 11:50:35,174 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 11:50:35,174 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 11:50:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 11:50:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 11:50:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 11:50:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 11:50:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 11:50:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 11:50:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 11:50:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 11:50:35,176 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 11:50:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 11:50:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 11:50:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 11:50:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 11:50:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2018-11-28 11:50:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:50:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 11:50:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2018-11-28 11:50:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:50:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:50:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 11:50:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:50:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:50:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:50:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:50:35,935 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:50:35,937 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 11:50:35,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:50:35 BoogieIcfgContainer [2018-11-28 11:50:35,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:50:35,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:50:35,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:50:35,944 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:50:35,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:50:34" (1/3) ... [2018-11-28 11:50:35,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c170014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:50:35, skipping insertion in model container [2018-11-28 11:50:35,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:34" (2/3) ... [2018-11-28 11:50:35,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c170014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:50:35, skipping insertion in model container [2018-11-28 11:50:35,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:50:35" (3/3) ... [2018-11-28 11:50:35,951 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-28 11:50:35,964 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:50:35,975 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-11-28 11:50:35,994 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-11-28 11:50:36,023 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:50:36,023 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:50:36,024 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 11:50:36,024 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:50:36,024 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:50:36,024 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:50:36,024 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:50:36,025 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:50:36,025 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:50:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-11-28 11:50:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 11:50:36,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:36,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:36,056 INFO L423 AbstractCegarLoop]: === Iteration 1 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:50:36,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:36,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1516979211, now seen corresponding path program 1 times [2018-11-28 11:50:36,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:36,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:36,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:36,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:36,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:36,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:36,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:36,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:50:36,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:50:36,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:50:36,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:50:36,319 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-11-28 11:50:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:36,636 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-11-28 11:50:36,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:50:36,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-28 11:50:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:36,650 INFO L225 Difference]: With dead ends: 68 [2018-11-28 11:50:36,651 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 11:50:36,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:50:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 11:50:36,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-28 11:50:36,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 11:50:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-11-28 11:50:36,704 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 9 [2018-11-28 11:50:36,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:36,704 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-11-28 11:50:36,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:50:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-28 11:50:36,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 11:50:36,706 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:36,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:36,706 INFO L423 AbstractCegarLoop]: === Iteration 2 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:50:36,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:36,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1516979210, now seen corresponding path program 1 times [2018-11-28 11:50:36,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:36,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:36,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:36,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:36,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:36,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:36,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:50:36,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:50:36,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:50:36,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:50:36,793 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 3 states. [2018-11-28 11:50:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:36,914 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-28 11:50:36,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:50:36,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-28 11:50:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:36,917 INFO L225 Difference]: With dead ends: 60 [2018-11-28 11:50:36,917 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 11:50:36,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:50:36,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 11:50:36,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-28 11:50:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 11:50:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-11-28 11:50:36,928 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 9 [2018-11-28 11:50:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:36,928 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-11-28 11:50:36,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:50:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-11-28 11:50:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 11:50:36,931 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:36,931 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:36,931 INFO L423 AbstractCegarLoop]: === Iteration 3 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:50:36,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:36,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1399930366, now seen corresponding path program 1 times [2018-11-28 11:50:36,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:36,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:36,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:36,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:36,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:37,100 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 11:50:37,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:50:37,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:50:37,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:37,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:50:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 11:50:37,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:50:37,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 11:50:37,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:50:37,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:50:37,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:50:37,547 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 6 states. [2018-11-28 11:50:38,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:38,499 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2018-11-28 11:50:38,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 11:50:38,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-28 11:50:38,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:38,502 INFO L225 Difference]: With dead ends: 110 [2018-11-28 11:50:38,502 INFO L226 Difference]: Without dead ends: 110 [2018-11-28 11:50:38,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:50:38,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-28 11:50:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 67. [2018-11-28 11:50:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 11:50:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-11-28 11:50:38,516 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 47 [2018-11-28 11:50:38,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:38,516 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-11-28 11:50:38,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:50:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-11-28 11:50:38,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 11:50:38,520 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:38,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:38,521 INFO L423 AbstractCegarLoop]: === Iteration 4 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:50:38,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:38,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1474040255, now seen corresponding path program 1 times [2018-11-28 11:50:38,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:38,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:38,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:38,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:38,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-28 11:50:38,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:38,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:50:38,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:50:38,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:50:38,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:50:38,684 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 5 states. [2018-11-28 11:50:39,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:39,015 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-11-28 11:50:39,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:50:39,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-28 11:50:39,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:39,020 INFO L225 Difference]: With dead ends: 81 [2018-11-28 11:50:39,020 INFO L226 Difference]: Without dead ends: 81 [2018-11-28 11:50:39,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:50:39,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-28 11:50:39,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-11-28 11:50:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 11:50:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2018-11-28 11:50:39,032 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 50 [2018-11-28 11:50:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:39,033 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-11-28 11:50:39,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:50:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2018-11-28 11:50:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 11:50:39,035 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:39,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:39,037 INFO L423 AbstractCegarLoop]: === Iteration 5 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:50:39,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:39,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1474040256, now seen corresponding path program 1 times [2018-11-28 11:50:39,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:39,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:39,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:39,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:39,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 11:50:39,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:39,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:50:39,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:50:39,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:50:39,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:50:39,245 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 5 states. [2018-11-28 11:50:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:39,537 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-28 11:50:39,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:50:39,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-28 11:50:39,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:39,541 INFO L225 Difference]: With dead ends: 85 [2018-11-28 11:50:39,541 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 11:50:39,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:50:39,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 11:50:39,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-11-28 11:50:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 11:50:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-11-28 11:50:39,550 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 50 [2018-11-28 11:50:39,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:39,552 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-11-28 11:50:39,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:50:39,552 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-11-28 11:50:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 11:50:39,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:39,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:39,555 INFO L423 AbstractCegarLoop]: === Iteration 6 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:50:39,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:39,557 INFO L82 PathProgramCache]: Analyzing trace with hash -963000911, now seen corresponding path program 1 times [2018-11-28 11:50:39,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:39,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:39,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:39,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:39,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 11:50:40,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:40,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:50:40,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:50:40,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:50:40,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:50:40,109 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 7 states. [2018-11-28 11:50:40,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:40,464 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-11-28 11:50:40,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:50:40,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-11-28 11:50:40,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:40,467 INFO L225 Difference]: With dead ends: 85 [2018-11-28 11:50:40,467 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 11:50:40,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:50:40,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 11:50:40,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-11-28 11:50:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 11:50:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-11-28 11:50:40,478 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 55 [2018-11-28 11:50:40,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:40,478 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-11-28 11:50:40,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:50:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-11-28 11:50:40,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 11:50:40,481 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:40,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:40,481 INFO L423 AbstractCegarLoop]: === Iteration 7 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:50:40,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:40,482 INFO L82 PathProgramCache]: Analyzing trace with hash 14257742, now seen corresponding path program 1 times [2018-11-28 11:50:40,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:40,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:40,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:40,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:40,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-28 11:50:40,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:40,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:50:40,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:50:40,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:50:40,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:50:40,874 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 6 states. [2018-11-28 11:50:41,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:41,254 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-11-28 11:50:41,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:50:41,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-11-28 11:50:41,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:41,275 INFO L225 Difference]: With dead ends: 85 [2018-11-28 11:50:41,275 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 11:50:41,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:50:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 11:50:41,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-11-28 11:50:41,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 11:50:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-11-28 11:50:41,283 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 57 [2018-11-28 11:50:41,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:41,283 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-11-28 11:50:41,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:50:41,283 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-11-28 11:50:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 11:50:41,287 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:41,287 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:41,287 INFO L423 AbstractCegarLoop]: === Iteration 8 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:50:41,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:41,292 INFO L82 PathProgramCache]: Analyzing trace with hash 14257743, now seen corresponding path program 1 times [2018-11-28 11:50:41,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:41,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:41,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:41,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:41,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:41,634 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 11:50:41,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:41,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:50:41,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:50:41,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:50:41,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:50:41,635 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-11-28 11:50:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:42,075 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-11-28 11:50:42,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:50:42,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-11-28 11:50:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:42,079 INFO L225 Difference]: With dead ends: 109 [2018-11-28 11:50:42,079 INFO L226 Difference]: Without dead ends: 109 [2018-11-28 11:50:42,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:50:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-28 11:50:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2018-11-28 11:50:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 11:50:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-11-28 11:50:42,087 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 57 [2018-11-28 11:50:42,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:42,088 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-11-28 11:50:42,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:50:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-11-28 11:50:42,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 11:50:42,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:42,091 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:42,091 INFO L423 AbstractCegarLoop]: === Iteration 9 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:50:42,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:42,092 INFO L82 PathProgramCache]: Analyzing trace with hash 64797246, now seen corresponding path program 1 times [2018-11-28 11:50:42,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:42,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:42,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:42,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:42,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:42,744 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 11:50:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 11:50:42,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:50:42,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:50:42,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:43,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:50:43,282 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 13 treesize of output 10 [2018-11-28 11:50:43,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 9 [2018-11-28 11:50:43,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:43,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:43,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:43,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-28 11:50:43,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:43,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:43,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 39 [2018-11-28 11:50:43,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:43,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:43,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2018-11-28 11:50:43,638 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 25 treesize of output 19 [2018-11-28 11:50:43,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-28 11:50:43,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:43,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:43,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:43,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2018-11-28 11:50:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 11:50:43,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:50:43,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-11-28 11:50:43,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 11:50:43,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 11:50:43,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-11-28 11:50:43,823 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 21 states. [2018-11-28 11:50:45,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:45,336 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-11-28 11:50:45,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 11:50:45,337 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-11-28 11:50:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:45,340 INFO L225 Difference]: With dead ends: 112 [2018-11-28 11:50:45,340 INFO L226 Difference]: Without dead ends: 112 [2018-11-28 11:50:45,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 11:50:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-28 11:50:45,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2018-11-28 11:50:45,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-28 11:50:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2018-11-28 11:50:45,349 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 57 [2018-11-28 11:50:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:45,350 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2018-11-28 11:50:45,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 11:50:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2018-11-28 11:50:45,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 11:50:45,352 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:45,352 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:45,352 INFO L423 AbstractCegarLoop]: === Iteration 10 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:50:45,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:45,353 INFO L82 PathProgramCache]: Analyzing trace with hash 64797247, now seen corresponding path program 1 times [2018-11-28 11:50:45,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:45,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:45,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:45,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:45,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:46,194 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-11-28 11:50:46,586 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 11:50:46,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:50:46,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:50:46,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:46,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:50:46,679 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 6 treesize of output 5 [2018-11-28 11:50:46,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:46,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:46,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:50:46,804 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 13 treesize of output 10 [2018-11-28 11:50:46,807 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 10 treesize of output 9 [2018-11-28 11:50:46,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:46,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:46,825 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 13 treesize of output 10 [2018-11-28 11:50:46,828 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 10 treesize of output 9 [2018-11-28 11:50:46,828 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:46,830 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:46,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:46,841 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-11-28 11:50:46,903 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 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-28 11:50:46,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:46,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:46,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-11-28 11:50:46,997 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 17 treesize of output 13 [2018-11-28 11:50:46,999 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 13 treesize of output 5 [2018-11-28 11:50:46,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:47,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:47,012 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 15 treesize of output 11 [2018-11-28 11:50:47,015 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 11 treesize of output 3 [2018-11-28 11:50:47,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:47,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:47,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:47,024 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:14 [2018-11-28 11:50:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 11:50:47,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:50:47,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 18 [2018-11-28 11:50:47,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 11:50:47,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 11:50:47,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-11-28 11:50:47,095 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 19 states. [2018-11-28 11:50:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:48,753 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-11-28 11:50:48,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 11:50:48,755 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-11-28 11:50:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:48,757 INFO L225 Difference]: With dead ends: 116 [2018-11-28 11:50:48,757 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 11:50:48,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2018-11-28 11:50:48,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 11:50:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2018-11-28 11:50:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-28 11:50:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2018-11-28 11:50:48,764 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 57 [2018-11-28 11:50:48,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:48,766 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2018-11-28 11:50:48,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 11:50:48,766 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2018-11-28 11:50:48,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 11:50:48,768 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:48,768 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:48,768 INFO L423 AbstractCegarLoop]: === Iteration 11 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:50:48,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:48,769 INFO L82 PathProgramCache]: Analyzing trace with hash 561616018, now seen corresponding path program 1 times [2018-11-28 11:50:48,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:48,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:48,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:48,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:48,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:49,411 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-11-28 11:50:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 11:50:50,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:50:50,055 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:50:50,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:50,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:50:50,271 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 13 treesize of output 10 [2018-11-28 11:50:50,276 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 10 treesize of output 9 [2018-11-28 11:50:50,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:50,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:50,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:50,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-28 11:50:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 11:50:50,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:50:50,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 20 [2018-11-28 11:50:50,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 11:50:50,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 11:50:50,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-11-28 11:50:50,439 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 20 states. [2018-11-28 11:50:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:51,867 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-11-28 11:50:51,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 11:50:51,868 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-11-28 11:50:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:51,870 INFO L225 Difference]: With dead ends: 112 [2018-11-28 11:50:51,871 INFO L226 Difference]: Without dead ends: 112 [2018-11-28 11:50:51,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2018-11-28 11:50:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-28 11:50:51,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-11-28 11:50:51,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 11:50:51,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-11-28 11:50:51,876 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 62 [2018-11-28 11:50:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:51,877 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-11-28 11:50:51,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 11:50:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-11-28 11:50:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 11:50:51,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:51,881 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:51,881 INFO L423 AbstractCegarLoop]: === Iteration 12 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:50:51,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:51,882 INFO L82 PathProgramCache]: Analyzing trace with hash 587278576, now seen corresponding path program 1 times [2018-11-28 11:50:51,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:51,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:51,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:51,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:51,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-28 11:50:52,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:52,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:50:52,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:50:52,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:50:52,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:50:52,491 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 6 states. [2018-11-28 11:50:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:52,632 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-11-28 11:50:52,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:50:52,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-28 11:50:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:52,635 INFO L225 Difference]: With dead ends: 98 [2018-11-28 11:50:52,635 INFO L226 Difference]: Without dead ends: 98 [2018-11-28 11:50:52,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:50:52,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-28 11:50:52,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2018-11-28 11:50:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-28 11:50:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-11-28 11:50:52,642 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 64 [2018-11-28 11:50:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:52,642 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-11-28 11:50:52,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:50:52,642 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-11-28 11:50:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 11:50:52,643 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:52,643 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:52,646 INFO L423 AbstractCegarLoop]: === Iteration 13 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:50:52,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:52,646 INFO L82 PathProgramCache]: Analyzing trace with hash 637818079, now seen corresponding path program 2 times [2018-11-28 11:50:52,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:52,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:52,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:52,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:52,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:53,508 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-28 11:50:53,875 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:50:53,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:50:53,875 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 [2018-11-28 11:50:53,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:50:53,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:50:53,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:50:53,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:50:54,122 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 13 treesize of output 10 [2018-11-28 11:50:54,124 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 10 treesize of output 9 [2018-11-28 11:50:54,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-28 11:50:54,299 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 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-28 11:50:54,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-11-28 11:50:54,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2018-11-28 11:50:54,472 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:54,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:54,496 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 13 treesize of output 10 [2018-11-28 11:50:54,500 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 10 treesize of output 9 [2018-11-28 11:50:54,500 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:54,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:54,637 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2018-11-28 11:50:55,267 WARN L180 SmtUtils]: Spent 506.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 11:50:55,817 WARN L180 SmtUtils]: Spent 503.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 11:50:55,834 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:55,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:55,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:55,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 42 [2018-11-28 11:50:55,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:55,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-11-28 11:50:55,868 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 13 treesize of output 16 [2018-11-28 11:50:55,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:55,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 11:50:55,873 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:55,878 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:55,889 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:55,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:55,909 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:62 [2018-11-28 11:50:56,039 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 15 treesize of output 11 [2018-11-28 11:50:56,041 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 11 treesize of output 3 [2018-11-28 11:50:56,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:56,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:56,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:56,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:54 [2018-11-28 11:50:56,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:56,361 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2018-11-28 11:50:56,387 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:50:56,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 11:50:56,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:56,499 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-11-28 11:50:56,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:56,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:56,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:56,519 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:24 [2018-11-28 11:50:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 40 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:50:56,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:50:56,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 36 [2018-11-28 11:50:56,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-28 11:50:56,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-28 11:50:56,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 11:50:56,655 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 37 states. [2018-11-28 11:50:58,653 WARN L180 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2018-11-28 11:50:59,767 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-11-28 11:51:01,598 WARN L180 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2018-11-28 11:51:02,737 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2018-11-28 11:51:04,622 WARN L180 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2018-11-28 11:51:05,829 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2018-11-28 11:51:07,998 WARN L180 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2018-11-28 11:51:09,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:51:09,427 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-11-28 11:51:09,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-28 11:51:09,430 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 64 [2018-11-28 11:51:09,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:51:09,432 INFO L225 Difference]: With dead ends: 128 [2018-11-28 11:51:09,432 INFO L226 Difference]: Without dead ends: 128 [2018-11-28 11:51:09,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=477, Invalid=3063, Unknown=0, NotChecked=0, Total=3540 [2018-11-28 11:51:09,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-28 11:51:09,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2018-11-28 11:51:09,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 11:51:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2018-11-28 11:51:09,440 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 64 [2018-11-28 11:51:09,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:51:09,440 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-11-28 11:51:09,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-28 11:51:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2018-11-28 11:51:09,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 11:51:09,442 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:51:09,443 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:51:09,443 INFO L423 AbstractCegarLoop]: === Iteration 14 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:51:09,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:51:09,443 INFO L82 PathProgramCache]: Analyzing trace with hash 637818080, now seen corresponding path program 2 times [2018-11-28 11:51:09,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:51:09,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:51:09,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:09,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:51:09,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:51:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:51:10,541 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2018-11-28 11:51:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 24 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:51:11,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:51:11,095 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 [2018-11-28 11:51:11,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:51:11,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:51:11,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:51:11,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:51:11,191 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 6 treesize of output 5 [2018-11-28 11:51:11,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:11,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:11,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:51:11,484 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 13 treesize of output 10 [2018-11-28 11:51:11,490 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 10 treesize of output 9 [2018-11-28 11:51:11,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:11,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:11,508 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 13 treesize of output 10 [2018-11-28 11:51:11,511 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 10 treesize of output 9 [2018-11-28 11:51:11,511 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:11,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:11,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:11,526 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-11-28 11:51:11,645 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 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-28 11:51:11,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:11,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:11,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2018-11-28 11:51:11,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:11,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:11,927 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:11,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:11,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:11,949 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2018-11-28 11:51:11,952 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:11,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:11,981 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:11,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:12,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:12,002 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:47 [2018-11-28 11:51:15,838 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 11:51:17,272 WARN L180 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 11:51:17,284 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:17,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-28 11:51:17,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:17,317 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:17,319 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:17,320 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 11 treesize of output 4 [2018-11-28 11:51:17,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:17,348 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 26 treesize of output 27 [2018-11-28 11:51:17,356 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 13 treesize of output 16 [2018-11-28 11:51:17,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:17,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 11:51:17,362 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:17,368 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:17,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:17,416 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 24 treesize of output 31 [2018-11-28 11:51:17,422 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 13 treesize of output 16 [2018-11-28 11:51:17,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:51:17,427 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 16 treesize of output 23 [2018-11-28 11:51:17,428 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:17,434 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:17,443 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:17,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:17,465 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:73, output treesize:67 [2018-11-28 11:51:17,897 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2018-11-28 11:51:17,900 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:51:17,901 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 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 11:51:17,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:17,915 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-28 11:51:17,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:17,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:17,951 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 24 [2018-11-28 11:51:17,954 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 15 treesize of output 5 [2018-11-28 11:51:17,954 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:17,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3 [2018-11-28 11:51:17,961 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:51:17,964 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:51:17,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:51:17,974 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:88, output treesize:23 [2018-11-28 11:51:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 35 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:51:18,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:51:18,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 42 [2018-11-28 11:51:18,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-28 11:51:18,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-28 11:51:18,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1650, Unknown=2, NotChecked=0, Total=1806 [2018-11-28 11:51:18,141 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 43 states. [2018-11-28 11:51:22,360 WARN L180 SmtUtils]: Spent 3.45 s on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2018-11-28 11:51:30,464 WARN L180 SmtUtils]: Spent 8.03 s on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2018-11-28 11:51:33,878 WARN L180 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2018-11-28 11:51:38,111 WARN L180 SmtUtils]: Spent 3.61 s on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2018-11-28 11:51:46,192 WARN L180 SmtUtils]: Spent 7.99 s on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2018-11-28 11:51:50,576 WARN L180 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2018-11-28 11:51:58,980 WARN L180 SmtUtils]: Spent 8.34 s on a formula simplification. DAG size of input: 109 DAG size of output: 76 [2018-11-28 11:51:59,369 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2018-11-28 11:51:59,553 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2018-11-28 11:52:03,738 WARN L180 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2018-11-28 11:52:04,205 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-28 11:52:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:52:06,044 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2018-11-28 11:52:06,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-28 11:52:06,045 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 64 [2018-11-28 11:52:06,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:52:06,046 INFO L225 Difference]: With dead ends: 132 [2018-11-28 11:52:06,047 INFO L226 Difference]: Without dead ends: 132 [2018-11-28 11:52:06,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1192 ImplicationChecksByTransitivity, 52.7s TimeCoverageRelationStatistics Valid=636, Invalid=4192, Unknown=2, NotChecked=0, Total=4830 [2018-11-28 11:52:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-28 11:52:06,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 107. [2018-11-28 11:52:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-28 11:52:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2018-11-28 11:52:06,054 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 64 [2018-11-28 11:52:06,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:52:06,055 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2018-11-28 11:52:06,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-28 11:52:06,055 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2018-11-28 11:52:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 11:52:06,056 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:52:06,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:06,059 INFO L423 AbstractCegarLoop]: === Iteration 15 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:52:06,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:06,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1941419947, now seen corresponding path program 1 times [2018-11-28 11:52:06,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:06,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:06,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:06,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:52:06,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-28 11:52:06,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:52:06,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 11:52:06,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:52:06,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:52:06,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:52:06,316 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 12 states. [2018-11-28 11:52:06,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:52:06,559 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2018-11-28 11:52:06,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:52:06,562 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-28 11:52:06,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:52:06,563 INFO L225 Difference]: With dead ends: 108 [2018-11-28 11:52:06,563 INFO L226 Difference]: Without dead ends: 102 [2018-11-28 11:52:06,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-11-28 11:52:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-28 11:52:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-28 11:52:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 11:52:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-11-28 11:52:06,571 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 70 [2018-11-28 11:52:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:52:06,571 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-11-28 11:52:06,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:52:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-11-28 11:52:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 11:52:06,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:52:06,574 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:06,575 INFO L423 AbstractCegarLoop]: === Iteration 16 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:52:06,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash 482244241, now seen corresponding path program 2 times [2018-11-28 11:52:06,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:06,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:06,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:06,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:06,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:07,289 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-11-28 11:52:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:52:08,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:52:08,375 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 [2018-11-28 11:52:08,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:52:08,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:52:08,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:52:08,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:52:08,719 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 13 treesize of output 10 [2018-11-28 11:52:08,721 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 10 treesize of output 9 [2018-11-28 11:52:08,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:08,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:08,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:08,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-28 11:52:08,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:08,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:08,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:08,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:30 [2018-11-28 11:52:08,953 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:52:08,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:52:08,976 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 13 treesize of output 10 [2018-11-28 11:52:08,979 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 10 treesize of output 9 [2018-11-28 11:52:08,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:08,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:08,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:52:08,995 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:34 [2018-11-28 11:52:10,111 WARN L180 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 11:52:10,918 WARN L180 SmtUtils]: Spent 760.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 11:52:10,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:10,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:10,932 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 11 treesize of output 4 [2018-11-28 11:52:10,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-28 11:52:10,970 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 13 treesize of output 16 [2018-11-28 11:52:10,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:10,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 11:52:10,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:10,991 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:11,006 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-11-28 11:52:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 23 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:52:11,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:52:11,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 22] total 53 [2018-11-28 11:52:11,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-28 11:52:11,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-28 11:52:11,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2565, Unknown=1, NotChecked=0, Total=2756 [2018-11-28 11:52:11,514 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 53 states. [2018-11-28 11:52:13,261 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-11-28 11:52:16,252 WARN L180 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2018-11-28 11:52:17,628 WARN L180 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2018-11-28 11:52:19,642 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-11-28 11:52:22,616 WARN L180 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-11-28 11:52:24,394 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2018-11-28 11:52:27,660 WARN L180 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2018-11-28 11:52:29,560 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2018-11-28 11:52:31,537 WARN L180 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2018-11-28 11:52:34,053 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2018-11-28 11:52:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:52:34,103 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-11-28 11:52:34,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-28 11:52:34,106 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 69 [2018-11-28 11:52:34,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:52:34,107 INFO L225 Difference]: With dead ends: 114 [2018-11-28 11:52:34,107 INFO L226 Difference]: Without dead ends: 114 [2018-11-28 11:52:34,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=1004, Invalid=7005, Unknown=1, NotChecked=0, Total=8010 [2018-11-28 11:52:34,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-28 11:52:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2018-11-28 11:52:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-28 11:52:34,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-11-28 11:52:34,114 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 69 [2018-11-28 11:52:34,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:52:34,114 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-11-28 11:52:34,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-28 11:52:34,115 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-28 11:52:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 11:52:34,115 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:52:34,116 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:34,118 INFO L423 AbstractCegarLoop]: === Iteration 17 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:52:34,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:34,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1670951710, now seen corresponding path program 3 times [2018-11-28 11:52:34,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:34,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:34,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:34,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:52:34,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:34,772 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-11-28 11:52:36,300 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2018-11-28 11:52:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:52:37,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:52:37,332 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 [2018-11-28 11:52:37,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:52:37,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 11:52:37,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:52:37,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:52:37,694 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 13 treesize of output 10 [2018-11-28 11:52:37,697 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 10 treesize of output 9 [2018-11-28 11:52:37,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:37,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:37,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:37,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-28 11:52:37,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:37,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:37,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 39 [2018-11-28 11:52:37,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:37,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:37,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2018-11-28 11:52:38,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:38,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:38,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:38,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2018-11-28 11:52:38,182 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:52:38,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:52:38,202 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 13 treesize of output 10 [2018-11-28 11:52:38,206 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 10 treesize of output 9 [2018-11-28 11:52:38,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:38,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:38,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:52:38,233 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2018-11-28 11:52:39,874 WARN L180 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 11:52:40,416 WARN L180 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 11:52:40,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:40,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:40,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:40,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-11-28 11:52:40,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:40,458 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:40,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 57 [2018-11-28 11:52:40,463 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 28 treesize of output 27 [2018-11-28 11:52:40,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:40,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-11-28 11:52:40,469 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:40,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:40,487 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:40,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:40,507 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:78 [2018-11-28 11:52:40,630 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 6 treesize of output 5 [2018-11-28 11:52:40,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:40,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:40,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-11-28 11:52:40,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:40,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:40,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:40,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:40,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:40,958 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:86, output treesize:56 [2018-11-28 11:52:40,962 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:52:40,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:52:40,996 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:52:41,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:52:41,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:52:41,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2018-11-28 11:52:44,088 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 11:52:45,712 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 11:52:45,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:45,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:45,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:45,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:45,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:45,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 103 [2018-11-28 11:52:45,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:45,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-28 11:52:45,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-28 11:52:45,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:45,799 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 16 treesize of output 23 [2018-11-28 11:52:45,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:45,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:45,817 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:45,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:45,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:45,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:45,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:45,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 123 [2018-11-28 11:52:45,874 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 46 treesize of output 42 [2018-11-28 11:52:45,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:45,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-11-28 11:52:45,911 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:45,922 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:45,947 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:45,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:45,986 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:114, output treesize:151 [2018-11-28 11:52:46,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:46,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 14 [2018-11-28 11:52:46,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:46,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:46,663 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 39 treesize of output 31 [2018-11-28 11:52:46,672 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 11 treesize of output 3 [2018-11-28 11:52:46,672 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:46,683 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:52:46,684 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 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:52:46,685 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:46,690 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:52:46,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:52:46,717 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:175, output treesize:127 [2018-11-28 11:52:47,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:47,014 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:47,014 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:52:47,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:47,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:47,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:47,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:47,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 102 [2018-11-28 11:52:47,022 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:52:47,046 INFO L478 Elim1Store]: Elim1 applied some 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 67 [2018-11-28 11:52:47,053 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-11-28 11:52:47,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2018-11-28 11:52:47,210 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 11:52:47,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2018-11-28 11:52:47,220 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 11:52:47,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2018-11-28 11:52:47,224 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:47,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2018-11-28 11:52:47,228 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:47,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:47,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 55 [2018-11-28 11:52:47,236 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:52:47,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 59 [2018-11-28 11:52:47,246 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-28 11:52:47,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2018-11-28 11:52:47,257 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 11:52:47,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-11-28 11:52:47,473 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:52:47,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:52:47,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-11-28 11:52:47,479 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:52:47,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-11-28 11:52:47,483 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:52:47,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2018-11-28 11:52:47,496 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:52:47,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2018-11-28 11:52:47,506 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:52:47,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 52 [2018-11-28 11:52:47,520 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:52:47,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 52 [2018-11-28 11:52:47,532 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:52:48,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-11-28 11:52:48,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 33 dim-0 vars, and 11 xjuncts. [2018-11-28 11:52:48,416 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 3 variables, input treesize:128, output treesize:496 [2018-11-28 11:52:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:52:48,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:52:48,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 54 [2018-11-28 11:52:49,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-28 11:52:49,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-28 11:52:49,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=2720, Unknown=3, NotChecked=0, Total=2970 [2018-11-28 11:52:49,004 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 55 states. [2018-11-28 11:52:54,225 WARN L180 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2018-11-28 11:52:57,116 WARN L180 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2018-11-28 11:53:02,207 WARN L180 SmtUtils]: Spent 4.61 s on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2018-11-28 11:53:05,685 WARN L180 SmtUtils]: Spent 3.42 s on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2018-11-28 11:53:10,571 WARN L180 SmtUtils]: Spent 4.43 s on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-11-28 11:53:13,998 WARN L180 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2018-11-28 11:53:19,464 WARN L180 SmtUtils]: Spent 4.96 s on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2018-11-28 11:53:23,075 WARN L180 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2018-11-28 11:53:23,802 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2018-11-28 11:53:24,572 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2018-11-28 11:53:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:25,567 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-11-28 11:53:25,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-28 11:53:25,568 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 71 [2018-11-28 11:53:25,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:53:25,569 INFO L225 Difference]: With dead ends: 126 [2018-11-28 11:53:25,570 INFO L226 Difference]: Without dead ends: 126 [2018-11-28 11:53:25,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2104 ImplicationChecksByTransitivity, 45.8s TimeCoverageRelationStatistics Valid=789, Invalid=6014, Unknown=3, NotChecked=0, Total=6806 [2018-11-28 11:53:25,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-28 11:53:25,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2018-11-28 11:53:25,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-28 11:53:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-11-28 11:53:25,576 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 71 [2018-11-28 11:53:25,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:53:25,576 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-11-28 11:53:25,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-28 11:53:25,576 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-11-28 11:53:25,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 11:53:25,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:53:25,577 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:25,577 INFO L423 AbstractCegarLoop]: === Iteration 18 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:53:25,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:25,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1670951711, now seen corresponding path program 3 times [2018-11-28 11:53:25,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:25,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:25,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:25,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:25,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:26,286 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-11-28 11:53:27,346 WARN L180 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2018-11-28 11:53:28,046 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-11-28 11:53:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:53:29,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:53:29,622 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 [2018-11-28 11:53:29,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:53:29,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 11:53:29,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:53:29,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:29,776 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 6 treesize of output 5 [2018-11-28 11:53:29,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:29,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:29,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:53:30,041 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 13 treesize of output 10 [2018-11-28 11:53:30,044 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 10 treesize of output 9 [2018-11-28 11:53:30,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:30,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:30,065 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 13 treesize of output 10 [2018-11-28 11:53:30,068 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 10 treesize of output 9 [2018-11-28 11:53:30,068 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:30,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:30,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:30,085 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-28 11:53:30,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:30,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:30,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-11-28 11:53:30,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:30,347 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 16 treesize of output 23 [2018-11-28 11:53:30,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:30,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:30,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:47 [2018-11-28 11:53:30,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:30,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:30,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:30,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:30,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:30,941 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:87, output treesize:57 [2018-11-28 11:53:30,944 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:53:30,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:53:30,972 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:53:30,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:53:30,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 11:53:30,995 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:56 [2018-11-28 11:53:39,451 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 42 [2018-11-28 11:53:40,985 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 42 [2018-11-28 11:53:41,024 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:41,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:41,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 40 [2018-11-28 11:53:41,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:41,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:41,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:41,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:41,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-11-28 11:53:41,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:41,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:41,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 66 [2018-11-28 11:53:41,123 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 28 treesize of output 27 [2018-11-28 11:53:41,126 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:41,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-11-28 11:53:41,128 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:41,136 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:41,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:41,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:41,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2018-11-28 11:53:41,199 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 13 treesize of output 16 [2018-11-28 11:53:41,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:41,204 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 16 treesize of output 23 [2018-11-28 11:53:41,205 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:41,210 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:41,224 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:41,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:41,257 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:99, output treesize:122 [2018-11-28 11:53:41,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:41,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:41,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:41,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:41,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:41,642 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2018-11-28 11:53:41,645 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:53:41,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:53:41,668 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:53:41,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:53:41,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:53:41,690 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:47 [2018-11-28 11:53:58,148 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 11:54:00,811 WARN L180 SmtUtils]: Spent 1.58 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 11:54:00,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:00,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:00,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:00,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:00,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2018-11-28 11:54:00,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:00,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:00,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:00,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:00,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:00,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:00,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-11-28 11:54:00,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:00,956 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:00,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:00,964 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:00,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:00,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 134 [2018-11-28 11:54:00,970 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 46 treesize of output 42 [2018-11-28 11:54:00,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:00,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-11-28 11:54:00,976 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:00,985 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:54:01,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:54:01,053 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:01,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:01,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:01,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 58 [2018-11-28 11:54:01,071 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 13 treesize of output 16 [2018-11-28 11:54:01,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:01,076 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 16 treesize of output 23 [2018-11-28 11:54:01,077 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:01,090 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:54:01,105 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:54:01,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:54:01,139 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:147, output treesize:163 [2018-11-28 11:54:02,266 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 11:54:04,752 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:04,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:04,755 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:04,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:04,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:04,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:04,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:04,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 201 [2018-11-28 11:54:04,769 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:04,792 INFO L478 Elim1Store]: Elim1 applied some 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 95 [2018-11-28 11:54:04,798 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-11-28 11:54:05,015 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:05,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 80 [2018-11-28 11:54:05,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 11:54:05,027 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:05,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2018-11-28 11:54:05,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:05,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:05,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:05,035 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:05,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2018-11-28 11:54:05,038 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:05,040 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:05,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-11-28 11:54:05,041 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:05,044 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:05,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 70 [2018-11-28 11:54:05,054 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-28 11:54:05,061 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:05,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 86 [2018-11-28 11:54:05,071 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-28 11:54:05,077 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:05,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 76 [2018-11-28 11:54:05,092 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 11:54:05,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 98 [2018-11-28 11:54:05,422 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:54:05,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:54:05,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 94 [2018-11-28 11:54:05,429 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:54:05,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 76 [2018-11-28 11:54:05,434 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:54:05,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 92 [2018-11-28 11:54:05,446 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:54:05,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 88 [2018-11-28 11:54:05,460 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:54:05,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 76 [2018-11-28 11:54:05,465 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:54:05,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 88 [2018-11-28 11:54:05,477 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:54:05,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-11-28 11:54:06,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2018-11-28 11:54:06,432 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:06,433 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 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:54:06,433 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,464 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 15 treesize of output 5 [2018-11-28 11:54:06,464 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,488 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 11:54:06,489 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,508 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2018-11-28 11:54:06,518 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:06,519 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 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:54:06,519 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,550 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:06,551 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-28 11:54:06,552 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,577 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 7 treesize of output 1 [2018-11-28 11:54:06,578 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,599 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2018-11-28 11:54:06,610 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:06,611 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 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:54:06,611 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,640 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 15 treesize of output 5 [2018-11-28 11:54:06,641 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,666 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 11:54:06,667 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,686 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2018-11-28 11:54:06,698 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:06,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-28 11:54:06,699 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,728 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 7 treesize of output 1 [2018-11-28 11:54:06,728 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,754 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:06,755 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 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:54:06,756 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,777 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2018-11-28 11:54:06,788 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:06,789 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-28 11:54:06,789 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,817 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:06,818 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 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:54:06,819 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,844 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 5 treesize of output 1 [2018-11-28 11:54:06,845 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,866 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2018-11-28 11:54:06,878 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 15 treesize of output 5 [2018-11-28 11:54:06,878 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,907 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 11:54:06,907 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,933 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:06,935 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 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:54:06,935 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,957 INFO L267 ElimStorePlain]: Start of recursive call 38: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:54:06,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2018-11-28 11:54:06,993 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 15 treesize of output 5 [2018-11-28 11:54:06,993 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,024 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:07,027 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 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:54:07,028 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,055 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 11:54:07,056 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,076 INFO L267 ElimStorePlain]: Start of recursive call 42: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2018-11-28 11:54:07,087 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:07,088 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 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:54:07,088 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,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 15 treesize of output 5 [2018-11-28 11:54:07,123 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,149 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 11:54:07,149 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,171 INFO L267 ElimStorePlain]: Start of recursive call 46: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2018-11-28 11:54:07,183 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 15 treesize of output 5 [2018-11-28 11:54:07,183 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,211 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 11:54:07,211 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,237 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:07,238 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 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:54:07,238 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,260 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2018-11-28 11:54:07,275 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:07,276 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-28 11:54:07,277 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,304 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 5 treesize of output 1 [2018-11-28 11:54:07,305 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,330 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:07,332 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 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:54:07,332 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,354 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2018-11-28 11:54:07,366 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 15 treesize of output 5 [2018-11-28 11:54:07,366 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,396 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 11:54:07,397 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,423 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:54:07,424 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 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:54:07,424 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,446 INFO L267 ElimStorePlain]: Start of recursive call 58: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:54:07,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 33 dim-0 vars, and 11 xjuncts. [2018-11-28 11:54:07,738 INFO L202 ElimStorePlain]: Needed 61 recursive calls to eliminate 4 variables, input treesize:219, output treesize:529 [2018-11-28 11:54:08,249 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 14 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:08,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:54:08,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 54 [2018-11-28 11:54:08,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-28 11:54:08,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-28 11:54:08,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2784, Unknown=20, NotChecked=0, Total=2970 [2018-11-28 11:54:08,271 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 55 states. [2018-11-28 11:54:33,287 WARN L180 SmtUtils]: Spent 5.10 s on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2018-11-28 11:54:38,715 WARN L180 SmtUtils]: Spent 5.11 s on a formula simplification. DAG size of input: 178 DAG size of output: 44 [2018-11-28 11:54:44,078 WARN L180 SmtUtils]: Spent 4.76 s on a formula simplification. DAG size of input: 136 DAG size of output: 39 [2018-11-28 11:54:58,858 WARN L180 SmtUtils]: Spent 3.69 s on a formula simplification. DAG size of input: 92 DAG size of output: 48 [2018-11-28 11:55:04,335 WARN L180 SmtUtils]: Spent 5.14 s on a formula simplification. DAG size of input: 196 DAG size of output: 52 [2018-11-28 11:55:17,636 WARN L180 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 100 DAG size of output: 56 [2018-11-28 11:55:22,248 WARN L180 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 205 DAG size of output: 68 [2018-11-28 11:55:22,614 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2018-11-28 11:55:24,592 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 60 [2018-11-28 11:55:27,917 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 70 [2018-11-28 11:55:36,043 WARN L180 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 109 DAG size of output: 65 [2018-11-28 11:55:40,340 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 212 DAG size of output: 75 [2018-11-28 11:55:40,571 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2018-11-28 11:55:40,862 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 66 [2018-11-28 11:55:41,268 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 104 [2018-11-28 11:55:41,972 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 118 [2018-11-28 11:55:42,371 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 106 [2018-11-28 11:55:42,782 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 108 [2018-11-28 11:55:43,296 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 120 [2018-11-28 11:55:43,616 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 108 [2018-11-28 11:55:44,024 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 110 [2018-11-28 11:55:44,483 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2018-11-28 11:55:44,804 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 71 [2018-11-28 11:55:45,617 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 83 [2018-11-28 11:55:46,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:55:46,531 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2018-11-28 11:55:46,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-28 11:55:46,533 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 71 [2018-11-28 11:55:46,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:55:46,536 INFO L225 Difference]: With dead ends: 127 [2018-11-28 11:55:46,536 INFO L226 Difference]: Without dead ends: 127 [2018-11-28 11:55:46,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 47 SyntacticMatches, 11 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2049 ImplicationChecksByTransitivity, 102.9s TimeCoverageRelationStatistics Valid=874, Invalid=7287, Unknown=29, NotChecked=0, Total=8190 [2018-11-28 11:55:46,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-28 11:55:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2018-11-28 11:55:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-28 11:55:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-11-28 11:55:46,544 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 71 [2018-11-28 11:55:46,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:55:46,544 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-11-28 11:55:46,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-28 11:55:46,544 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-11-28 11:55:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 11:55:46,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:55:46,549 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:55:46,549 INFO L423 AbstractCegarLoop]: === Iteration 19 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:55:46,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:55:46,550 INFO L82 PathProgramCache]: Analyzing trace with hash 246818738, now seen corresponding path program 3 times [2018-11-28 11:55:46,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:55:46,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:55:46,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:55:46,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:55:46,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:55:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:55:47,816 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-28 11:55:48,774 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:55:48,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:55:48,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:55:48,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:55:48,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 11:55:48,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:55:48,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:55:49,124 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 13 treesize of output 10 [2018-11-28 11:55:49,126 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 10 treesize of output 9 [2018-11-28 11:55:49,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:55:49,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:55:49,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:55:49,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-28 11:55:49,292 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:55:49,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:55:49,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:55:49,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-11-28 11:55:49,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:55:49,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:55:49,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:55:49,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:44 [2018-11-28 11:55:49,483 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 13 treesize of output 10 [2018-11-28 11:55:49,503 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 10 treesize of output 9 [2018-11-28 11:55:49,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:55:49,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:55:49,559 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:55:49,586 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:55:49,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:55:49,602 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:48 [2018-11-28 11:55:50,401 WARN L180 SmtUtils]: Spent 734.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 11:55:51,184 WARN L180 SmtUtils]: Spent 690.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 11:55:51,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:55:51,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:55:51,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:55:51,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:55:51,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-28 11:55:51,217 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 13 treesize of output 16 [2018-11-28 11:55:51,221 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:55:51,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 11:55:51,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:55:51,228 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:55:51,236 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:55:51,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:55:51,255 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:51 [2018-11-28 11:55:51,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:55:51,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:55:51,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:55:51,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:55:51,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:55:51,588 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2018-11-28 11:55:51,591 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:55:51,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:55:51,611 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:55:51,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:55:51,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:55:51,630 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:47 [2018-11-28 11:55:54,547 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 11:55:56,030 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 11:55:56,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:55:56,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:55:56,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:55:56,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:55:56,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 11:55:56,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:55:56,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-28 11:55:56,146 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 13 treesize of output 16 [2018-11-28 11:55:56,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:55:56,151 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 16 treesize of output 23 [2018-11-28 11:55:56,151 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:55:56,157 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:55:56,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:55:56,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:55:56,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 70 [2018-11-28 11:55:56,226 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 60 treesize of output 59 [2018-11-28 11:55:56,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:55:56,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-11-28 11:55:56,232 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:55:56,247 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:55:56,281 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:55:56,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:55:56,307 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:88, output treesize:90 [2018-11-28 11:55:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:55:57,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:55:57,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 30] total 70 [2018-11-28 11:55:57,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-28 11:55:57,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-28 11:55:57,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=4557, Unknown=2, NotChecked=0, Total=4830 [2018-11-28 11:55:57,546 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 70 states. [2018-11-28 11:56:16,217 WARN L180 SmtUtils]: Spent 4.56 s on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2018-11-28 11:56:22,624 WARN L180 SmtUtils]: Spent 6.19 s on a formula simplification. DAG size of input: 159 DAG size of output: 53 [2018-11-28 11:56:28,911 WARN L180 SmtUtils]: Spent 5.97 s on a formula simplification. DAG size of input: 116 DAG size of output: 45 [2018-11-28 11:56:42,802 WARN L180 SmtUtils]: Spent 4.52 s on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2018-11-28 11:56:49,241 WARN L180 SmtUtils]: Spent 6.25 s on a formula simplification. DAG size of input: 163 DAG size of output: 58 [2018-11-28 11:57:00,436 WARN L180 SmtUtils]: Spent 4.63 s on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2018-11-28 11:57:06,902 WARN L180 SmtUtils]: Spent 6.27 s on a formula simplification. DAG size of input: 174 DAG size of output: 66 [2018-11-28 11:57:08,722 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2018-11-28 11:57:10,892 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2018-11-28 11:57:15,875 WARN L180 SmtUtils]: Spent 4.69 s on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2018-11-28 11:57:22,353 WARN L180 SmtUtils]: Spent 6.24 s on a formula simplification. DAG size of input: 183 DAG size of output: 74 [2018-11-28 11:57:22,744 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2018-11-28 11:57:22,953 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2018-11-28 11:57:23,183 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2018-11-28 11:57:23,529 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2018-11-28 11:57:23,745 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2018-11-28 11:57:23,975 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2018-11-28 11:57:24,332 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2018-11-28 11:57:24,556 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-11-28 11:57:24,798 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2018-11-28 11:57:25,159 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2018-11-28 11:57:25,391 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2018-11-28 11:57:25,627 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2018-11-28 11:57:26,006 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 59 [2018-11-28 11:57:27,313 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2018-11-28 11:57:27,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:57:27,418 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-11-28 11:57:27,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-28 11:57:27,421 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 76 [2018-11-28 11:57:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:57:27,422 INFO L225 Difference]: With dead ends: 123 [2018-11-28 11:57:27,422 INFO L226 Difference]: Without dead ends: 123 [2018-11-28 11:57:27,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3633 ImplicationChecksByTransitivity, 76.6s TimeCoverageRelationStatistics Valid=1361, Invalid=11285, Unknown=10, NotChecked=0, Total=12656 [2018-11-28 11:57:27,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-28 11:57:27,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2018-11-28 11:57:27,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-28 11:57:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2018-11-28 11:57:27,430 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 76 [2018-11-28 11:57:27,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:57:27,430 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2018-11-28 11:57:27,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-28 11:57:27,430 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2018-11-28 11:57:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 11:57:27,431 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:57:27,431 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:57:27,431 INFO L423 AbstractCegarLoop]: === Iteration 20 === [insert_listErr7REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 11:57:27,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:27,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1234657281, now seen corresponding path program 4 times [2018-11-28 11:57:27,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:27,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:27,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:27,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:57:27,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:57:28,804 WARN L180 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2018-11-28 11:57:29,581 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-28 11:57:30,279 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2018-11-28 11:57:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 83 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:57:32,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:57:32,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:57:32,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 11:57:32,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 11:57:32,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:57:32,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:57:32,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:57:32,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 8 treesize of output 7 [2018-11-28 11:57:32,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:32,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:32,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:32,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-11-28 11:57:32,609 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 27 treesize of output 22 [2018-11-28 11:57:32,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:57:32,615 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 22 treesize of output 14 [2018-11-28 11:57:32,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:32,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:32,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:32,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2018-11-28 11:57:35,476 WARN L180 SmtUtils]: Spent 540.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 11:57:35,482 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 13 treesize of output 10 [2018-11-28 11:57:35,484 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 10 treesize of output 9 [2018-11-28 11:57:35,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:35,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:35,505 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 13 treesize of output 10 [2018-11-28 11:57:35,508 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 10 treesize of output 9 [2018-11-28 11:57:35,509 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:35,511 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:35,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:57:35,524 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-11-28 11:57:37,675 WARN L180 SmtUtils]: Spent 531.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 11:57:38,321 WARN L180 SmtUtils]: Spent 526.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 11:57:38,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:57:38,328 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:57:38,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 39 [2018-11-28 11:57:38,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:38,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 36 treesize of output 43 [2018-11-28 11:57:38,357 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 19 treesize of output 22 [2018-11-28 11:57:38,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:57:38,362 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 22 treesize of output 14 [2018-11-28 11:57:38,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:38,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:38,370 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:38,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:38,384 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:52 [2018-11-28 11:57:39,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:39,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:39,404 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:39,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:39,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:57:39,428 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:62 [2018-11-28 11:57:40,889 WARN L180 SmtUtils]: Spent 825.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-28 11:57:40,893 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:57:40,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:57:40,922 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:57:40,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:57:40,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 11:57:40,946 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:69 [2018-11-28 11:58:01,779 WARN L180 SmtUtils]: Spent 2.86 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 11:58:06,078 WARN L180 SmtUtils]: Spent 2.83 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 11:58:06,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:06,089 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:06,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:06,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-11-28 11:58:06,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:06,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-28 11:58:06,143 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 13 treesize of output 16 [2018-11-28 11:58:06,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:06,150 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 16 treesize of output 23 [2018-11-28 11:58:06,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:06,159 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:06,169 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:06,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2018-11-28 11:58:06,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-28 11:58:06,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:06,236 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 22 treesize of output 14 [2018-11-28 11:58:06,237 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:06,241 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:06,248 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:06,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:06,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 68 [2018-11-28 11:58:06,292 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 28 treesize of output 27 [2018-11-28 11:58:06,295 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:06,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-11-28 11:58:06,297 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:06,304 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:06,318 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:06,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:06,348 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:109, output treesize:108 [2018-11-28 11:58:06,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:06,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:06,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:06,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:06,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:58:06,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:56 [2018-11-28 11:58:10,235 WARN L180 SmtUtils]: Spent 724.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 11:58:10,238 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:58:10,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:58:10,263 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:58:10,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:58:10,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 11:58:10,282 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:63 [2018-11-28 11:58:42,768 WARN L180 SmtUtils]: Spent 2.72 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 11:58:48,468 WARN L180 SmtUtils]: Spent 2.81 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 11:58:48,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:48,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:48,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:48,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:48,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:48,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-11-28 11:58:48,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:48,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2018-11-28 11:58:48,536 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 19 treesize of output 22 [2018-11-28 11:58:48,539 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:48,541 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 22 treesize of output 14 [2018-11-28 11:58:48,541 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:48,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:48,555 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:48,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:48,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 52 [2018-11-28 11:58:48,607 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 13 treesize of output 16 [2018-11-28 11:58:48,611 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:48,613 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 16 treesize of output 23 [2018-11-28 11:58:48,614 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:48,621 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:48,636 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:48,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:48,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:48,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:48,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:48,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 127 [2018-11-28 11:58:48,683 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 46 treesize of output 42 [2018-11-28 11:58:48,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:48,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-11-28 11:58:48,690 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:48,700 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:48,724 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:48,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:48,755 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:151, output treesize:134 [2018-11-28 11:58:50,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:50,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:50,323 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:50,325 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:58:50,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:50,328 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:50,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:50,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:50,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 179 [2018-11-28 11:58:50,343 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:58:50,366 INFO L478 Elim1Store]: Elim1 applied some 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 102 [2018-11-28 11:58:50,371 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-11-28 11:58:50,527 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:58:50,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2018-11-28 11:58:50,529 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:50,563 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:58:50,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 113 [2018-11-28 11:58:50,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 11:58:50,611 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:58:50,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 119 [2018-11-28 11:58:50,626 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 11:58:50,629 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:58:50,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2018-11-28 11:58:50,629 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:50,633 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:58:50,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 103 [2018-11-28 11:58:50,642 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-28 11:58:50,645 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:58:50,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 109 [2018-11-28 11:58:50,655 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-28 11:58:50,658 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:58:50,659 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:50,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 115 [2018-11-28 11:58:50,663 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:50,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:50,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-11-28 11:58:50,951 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:58:50,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 77 [2018-11-28 11:58:50,962 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:58:50,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 77 [2018-11-28 11:58:50,973 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:58:50,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 93 [2018-11-28 11:58:50,987 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:58:50,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-11-28 11:58:50,990 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:58:50,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-11-28 11:58:50,993 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:58:51,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 81 [2018-11-28 11:58:51,005 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:58:51,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-11-28 11:58:51,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-11-28 11:58:51,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2018-11-28 11:58:51,719 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:51,739 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 15 treesize of output 5 [2018-11-28 11:58:51,739 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:51,757 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 11 treesize of output 3 [2018-11-28 11:58:51,758 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:51,772 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:51,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-11-28 11:58:51,782 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:58:51,783 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 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-28 11:58:51,783 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:51,807 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 11 treesize of output 3 [2018-11-28 11:58:51,808 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:51,826 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 7 treesize of output 1 [2018-11-28 11:58:51,826 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:51,842 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:51,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-11-28 11:58:51,851 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:58:51,852 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 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-28 11:58:51,852 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:51,874 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 11 treesize of output 3 [2018-11-28 11:58:51,874 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:51,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 7 treesize of output 1 [2018-11-28 11:58:51,896 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:51,911 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:51,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-11-28 11:58:51,921 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:58:51,922 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 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 11:58:51,923 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:51,945 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 17 treesize of output 7 [2018-11-28 11:58:51,945 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:51,964 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 7 treesize of output 1 [2018-11-28 11:58:51,965 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:51,979 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:51,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-11-28 11:58:51,990 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:58:51,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 11:58:51,992 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,027 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 11 treesize of output 1 [2018-11-28 11:58:52,027 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,045 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 5 treesize of output 1 [2018-11-28 11:58:52,046 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,061 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-11-28 11:58:52,071 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:58:52,072 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 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-28 11:58:52,072 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,094 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 11 treesize of output 3 [2018-11-28 11:58:52,094 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,111 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 5 treesize of output 1 [2018-11-28 11:58:52,111 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,126 INFO L267 ElimStorePlain]: Start of recursive call 38: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-11-28 11:58:52,165 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:58:52,166 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 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 11:58:52,166 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,186 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 5 treesize of output 1 [2018-11-28 11:58:52,187 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,205 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 5 treesize of output 1 [2018-11-28 11:58:52,206 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,222 INFO L267 ElimStorePlain]: Start of recursive call 42: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-11-28 11:58:52,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2018-11-28 11:58:52,239 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,259 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 15 treesize of output 5 [2018-11-28 11:58:52,259 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,277 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 11 treesize of output 3 [2018-11-28 11:58:52,277 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,293 INFO L267 ElimStorePlain]: Start of recursive call 46: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-11-28 11:58:52,304 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:58:52,305 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 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-28 11:58:52,305 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,326 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 11 treesize of output 3 [2018-11-28 11:58:52,326 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,345 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 5 treesize of output 1 [2018-11-28 11:58:52,346 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,362 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-11-28 11:58:52,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2018-11-28 11:58:52,373 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,394 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 15 treesize of output 5 [2018-11-28 11:58:52,394 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,412 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 11 treesize of output 3 [2018-11-28 11:58:52,412 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,427 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-11-28 11:58:52,436 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:58:52,437 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 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-28 11:58:52,437 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,459 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 11 treesize of output 3 [2018-11-28 11:58:52,460 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:58:52,478 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,497 INFO L267 ElimStorePlain]: Start of recursive call 58: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,704 INFO L202 ElimStorePlain]: Needed 61 recursive calls to eliminate 3 variables, input treesize:190, output treesize:14 [2018-11-28 11:58:52,962 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 15 treesize of output 11 [2018-11-28 11:58:52,965 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 11 treesize of output 3 [2018-11-28 11:58:52,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:52,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-28 11:58:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:58:53,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:58:53,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 70 [2018-11-28 11:58:53,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-28 11:58:53,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-28 11:58:53,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=4618, Unknown=42, NotChecked=0, Total=4830 [2018-11-28 11:58:53,242 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 70 states. [2018-11-28 11:59:08,701 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-11-28 11:59:26,501 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-11-28 11:59:50,077 WARN L180 SmtUtils]: Spent 9.44 s on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2018-11-28 12:00:00,345 WARN L180 SmtUtils]: Spent 9.68 s on a formula simplification. DAG size of input: 177 DAG size of output: 67 [2018-11-28 12:00:10,890 WARN L180 SmtUtils]: Spent 9.31 s on a formula simplification. DAG size of input: 128 DAG size of output: 61 [2018-11-28 12:00:18,627 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2018-11-28 12:00:25,190 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2018-11-28 12:00:31,754 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2018-11-28 12:00:46,435 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 70 [2018-11-28 12:00:50,858 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2018-11-28 12:00:57,647 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2018-11-28 12:01:05,285 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2018-11-28 12:01:09,441 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-11-28 12:01:15,890 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-11-28 12:01:16,326 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 113 [2018-11-28 12:01:16,907 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-11-28 12:01:17,606 WARN L180 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 142 [2018-11-28 12:01:18,008 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 124 [2018-11-28 12:01:18,530 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 121 [2018-11-28 12:01:19,169 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 144 [2018-11-28 12:01:19,568 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 121 [2018-11-28 12:01:20,092 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 123 [2018-11-28 12:01:20,689 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 141 [2018-11-28 12:01:21,043 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-11-28 12:01:21,537 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2018-11-28 12:01:21,899 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2018-11-28 12:01:30,718 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2018-11-28 12:01:37,052 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2018-11-28 12:01:39,531 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2018-11-28 12:01:39,800 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2018-11-28 12:01:40,141 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2018-11-28 12:01:40,358 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2018-11-28 12:01:40,588 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2018-11-28 12:01:40,872 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 98 [2018-11-28 12:01:41,095 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2018-11-28 12:01:41,340 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 92 [2018-11-28 12:01:41,602 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 98 [2018-11-28 12:01:41,967 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2018-11-28 12:01:42,164 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2018-11-28 12:01:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:01:42,165 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2018-11-28 12:01:42,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-28 12:01:42,166 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 78 [2018-11-28 12:01:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:01:42,166 INFO L225 Difference]: With dead ends: 128 [2018-11-28 12:01:42,166 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:01:42,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3048 ImplicationChecksByTransitivity, 170.1s TimeCoverageRelationStatistics Valid=933, Invalid=13996, Unknown=77, NotChecked=0, Total=15006 [2018-11-28 12:01:42,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:01:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:01:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:01:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:01:42,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2018-11-28 12:01:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:01:42,169 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:01:42,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-28 12:01:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:01:42,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:01:42,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:01:42 BoogieIcfgContainer [2018-11-28 12:01:42,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:01:42,177 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:01:42,177 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:01:42,177 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:01:42,178 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:50:35" (3/4) ... [2018-11-28 12:01:42,186 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:01:42,197 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:01:42,198 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure insert_list [2018-11-28 12:01:42,199 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:01:42,199 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-28 12:01:42,199 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure search_list [2018-11-28 12:01:42,204 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-28 12:01:42,205 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 12:01:42,205 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 12:01:42,252 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 12:01:42,252 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:01:42,253 INFO L168 Benchmark]: Toolchain (without parser) took 668011.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 951.3 MB in the beginning and 794.2 MB in the end (delta: 157.1 MB). Peak memory consumption was 311.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:01:42,255 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. [2018-11-28 12:01:42,256 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:01:42,257 INFO L168 Benchmark]: Boogie Preprocessor took 116.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:01:42,257 INFO L168 Benchmark]: RCFGBuilder took 858.68 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: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:01:42,257 INFO L168 Benchmark]: TraceAbstraction took 666237.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.4 MB). Free memory was 1.1 GB in the beginning and 801.3 MB in the end (delta: 262.2 MB). Peak memory consumption was 280.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:01:42,258 INFO L168 Benchmark]: Witness Printer took 74.92 ms. Allocated memory is still 1.2 GB. Free memory was 801.3 MB in the beginning and 794.2 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:01:42,261 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 717.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 116.37 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 858.68 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: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 666237.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.4 MB). Free memory was 1.1 GB in the beginning and 801.3 MB in the end (delta: 262.2 MB). Peak memory consumption was 280.6 MB. Max. memory is 11.5 GB. * Witness Printer took 74.92 ms. Allocated memory is still 1.2 GB. Free memory was 801.3 MB in the beginning and 794.2 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 654]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 643]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 655]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 654]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 72 locations, 19 error locations. SAFE Result, 666.1s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 485.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 964 SDtfs, 4795 SDslu, 5165 SDs, 0 SdLazy, 18697 SolverSat, 1339 SolverUnsat, 87 SolverUnknown, 0 SolverNotchecked, 152.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1420 GetRequests, 564 SyntacticMatches, 69 SemanticMatches, 787 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15867 ImplicationChecksByTransitivity, 493.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=18, 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, 20 MinimizatonAttempts, 244 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 178.2s InterpolantComputationTime, 1853 NumberOfCodeBlocks, 1849 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1822 ConstructedInterpolants, 115 QuantifiedInterpolants, 3666187 SizeOfPredicates, 233 NumberOfNonLiveVariables, 4301 ConjunctsInSsa, 916 ConjunctsInUnsatCore, 31 InterpolantComputations, 9 PerfectInterpolantSequences, 903/1608 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...