./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 635dfa2a 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-635dfa2 [2018-11-28 13:07:22,258 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:07:22,260 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:07:22,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:07:22,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:07:22,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:07:22,283 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:07:22,286 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:07:22,289 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:07:22,291 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:07:22,292 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:07:22,292 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:07:22,295 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:07:22,298 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:07:22,306 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:07:22,307 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:07:22,310 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:07:22,313 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:07:22,316 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:07:22,321 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:07:22,322 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:07:22,326 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:07:22,331 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:07:22,334 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:07:22,334 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:07:22,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:07:22,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:07:22,340 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:07:22,342 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:07:22,344 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:07:22,346 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:07:22,347 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:07:22,347 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:07:22,347 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:07:22,351 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:07:22,352 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:07:22,352 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2018-11-28 13:07:22,381 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:07:22,381 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:07:22,382 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:07:22,386 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:07:22,387 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:07:22,387 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:07:22,387 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:07:22,387 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:07:22,391 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:07:22,391 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:07:22,391 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:07:22,391 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:07:22,392 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:07:22,392 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 13:07:22,392 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 13:07:22,392 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:07:22,392 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:07:22,392 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:07:22,395 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:07:22,395 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:07:22,395 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:07:22,395 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:07:22,396 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:07:22,396 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:07:22,396 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:07:22,396 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:07:22,396 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:07:22,397 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 13:07:22,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:07:22,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:07:22,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:07:22,468 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:07:22,468 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:07:22,470 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 13:07:22,543 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8c7df145/71dd1a0f24b04f7fb56cbb23da844508/FLAGd374f2343 [2018-11-28 13:07:23,056 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:07:23,059 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-28 13:07:23,074 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8c7df145/71dd1a0f24b04f7fb56cbb23da844508/FLAGd374f2343 [2018-11-28 13:07:23,355 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8c7df145/71dd1a0f24b04f7fb56cbb23da844508 [2018-11-28 13:07:23,360 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:07:23,361 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 13:07:23,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:07:23,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:07:23,367 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:07:23,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:07:23" (1/1) ... [2018-11-28 13:07:23,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@806a026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:23, skipping insertion in model container [2018-11-28 13:07:23,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:07:23" (1/1) ... [2018-11-28 13:07:23,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:07:23,432 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:07:23,888 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:07:23,906 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:07:23,969 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:07:24,132 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:07:24,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:24 WrapperNode [2018-11-28 13:07:24,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:07:24,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:07:24,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:07:24,134 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:07:24,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:24" (1/1) ... [2018-11-28 13:07:24,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:24" (1/1) ... [2018-11-28 13:07:24,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:24" (1/1) ... [2018-11-28 13:07:24,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:24" (1/1) ... [2018-11-28 13:07:24,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:24" (1/1) ... [2018-11-28 13:07:24,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:24" (1/1) ... [2018-11-28 13:07:24,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:24" (1/1) ... [2018-11-28 13:07:24,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:07:24,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:07:24,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:07:24,229 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:07:24,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:24" (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 13:07:24,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:07:24,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:07:24,301 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 13:07:24,301 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2018-11-28 13:07:24,302 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2018-11-28 13:07:24,302 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:07:24,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 13:07:24,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 13:07:24,302 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 13:07:24,303 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 13:07:24,303 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 13:07:24,303 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 13:07:24,304 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 13:07:24,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 13:07:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 13:07:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 13:07:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 13:07:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 13:07:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 13:07:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 13:07:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 13:07:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 13:07:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 13:07:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 13:07:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 13:07:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 13:07:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 13:07:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 13:07:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 13:07:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 13:07:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 13:07:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 13:07:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 13:07:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 13:07:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 13:07:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 13:07:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 13:07:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 13:07:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 13:07:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 13:07:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 13:07:24,311 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 13:07:24,311 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 13:07:24,311 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 13:07:24,311 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 13:07:24,311 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 13:07:24,311 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 13:07:24,311 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 13:07:24,312 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 13:07:24,312 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 13:07:24,312 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 13:07:24,312 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 13:07:24,312 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 13:07:24,312 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 13:07:24,312 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 13:07:24,312 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 13:07:24,313 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 13:07:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 13:07:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 13:07:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 13:07:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 13:07:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 13:07:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 13:07:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 13:07:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 13:07:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 13:07:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 13:07:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 13:07:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 13:07:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 13:07:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 13:07:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 13:07:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 13:07:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 13:07:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 13:07:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 13:07:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 13:07:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 13:07:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 13:07:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 13:07:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 13:07:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 13:07:24,319 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 13:07:24,320 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 13:07:24,320 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 13:07:24,321 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 13:07:24,321 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 13:07:24,321 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 13:07:24,321 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 13:07:24,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 13:07:24,321 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 13:07:24,321 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 13:07:24,322 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 13:07:24,323 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 13:07:24,323 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 13:07:24,323 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 13:07:24,323 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 13:07:24,323 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 13:07:24,323 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 13:07:24,323 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 13:07:24,323 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 13:07:24,324 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 13:07:24,324 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 13:07:24,324 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 13:07:24,324 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 13:07:24,324 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 13:07:24,324 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 13:07:24,324 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 13:07:24,324 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 13:07:24,326 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2018-11-28 13:07:24,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:07:24,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 13:07:24,326 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2018-11-28 13:07:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:07:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:07:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 13:07:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:07:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:07:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:07:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:07:25,109 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:07:25,110 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 13:07:25,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:07:25 BoogieIcfgContainer [2018-11-28 13:07:25,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:07:25,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:07:25,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:07:25,114 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:07:25,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:07:23" (1/3) ... [2018-11-28 13:07:25,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1036d7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:07:25, skipping insertion in model container [2018-11-28 13:07:25,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:24" (2/3) ... [2018-11-28 13:07:25,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1036d7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:07:25, skipping insertion in model container [2018-11-28 13:07:25,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:07:25" (3/3) ... [2018-11-28 13:07:25,118 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-28 13:07:25,130 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:07:25,138 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-11-28 13:07:25,157 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-11-28 13:07:25,186 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:07:25,187 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:07:25,187 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 13:07:25,187 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:07:25,187 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:07:25,188 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:07:25,188 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:07:25,188 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:07:25,188 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:07:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-11-28 13:07:25,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 13:07:25,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:07:25,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:07:25,223 INFO L423 AbstractCegarLoop]: === Iteration 1 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:07:25,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:07:25,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1516979211, now seen corresponding path program 1 times [2018-11-28 13:07:25,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:07:25,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:07:25,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:25,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:07:25,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:07:25,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:07:25,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:07:25,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:07:25,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:07:25,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:07:25,454 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-11-28 13:07:25,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:07:25,769 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-11-28 13:07:25,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:07:25,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-28 13:07:25,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:07:25,784 INFO L225 Difference]: With dead ends: 68 [2018-11-28 13:07:25,784 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 13:07:25,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:07:25,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 13:07:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-28 13:07:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 13:07:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-11-28 13:07:25,837 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 9 [2018-11-28 13:07:25,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:07:25,837 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-11-28 13:07:25,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:07:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-28 13:07:25,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 13:07:25,838 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:07:25,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:07:25,839 INFO L423 AbstractCegarLoop]: === Iteration 2 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:07:25,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:07:25,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1516979210, now seen corresponding path program 1 times [2018-11-28 13:07:25,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:07:25,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:07:25,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:25,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:07:25,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:07:25,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:07:25,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:07:25,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:07:25,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:07:25,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:07:25,924 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 3 states. [2018-11-28 13:07:26,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:07:26,153 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-28 13:07:26,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:07:26,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-28 13:07:26,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:07:26,160 INFO L225 Difference]: With dead ends: 60 [2018-11-28 13:07:26,160 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 13:07:26,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:07:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 13:07:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-28 13:07:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 13:07:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-11-28 13:07:26,174 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 9 [2018-11-28 13:07:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:07:26,174 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-11-28 13:07:26,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:07:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-11-28 13:07:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 13:07:26,177 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:07:26,177 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 13:07:26,177 INFO L423 AbstractCegarLoop]: === Iteration 3 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:07:26,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:07:26,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1399930366, now seen corresponding path program 1 times [2018-11-28 13:07:26,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:07:26,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:07:26,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:26,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:07:26,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:26,387 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 13:07:26,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:07:26,387 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 13:07:26,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:07:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:26,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:07:26,629 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 13:07:26,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:07:26,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 13:07:26,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:07:26,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:07:26,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:07:26,656 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 6 states. [2018-11-28 13:07:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:07:27,549 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2018-11-28 13:07:27,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:07:27,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-28 13:07:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:07:27,552 INFO L225 Difference]: With dead ends: 110 [2018-11-28 13:07:27,552 INFO L226 Difference]: Without dead ends: 110 [2018-11-28 13:07:27,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:07:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-28 13:07:27,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 67. [2018-11-28 13:07:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 13:07:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-11-28 13:07:27,568 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 47 [2018-11-28 13:07:27,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:07:27,568 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-11-28 13:07:27,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:07:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-11-28 13:07:27,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 13:07:27,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:07:27,572 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 13:07:27,572 INFO L423 AbstractCegarLoop]: === Iteration 4 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:07:27,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:07:27,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1474040255, now seen corresponding path program 1 times [2018-11-28 13:07:27,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:07:27,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:07:27,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:27,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:07:27,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:27,816 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 13:07:27,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:07:27,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:07:27,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:07:27,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:07:27,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:07:27,818 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 5 states. [2018-11-28 13:07:28,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:07:28,113 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-11-28 13:07:28,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:07:28,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-28 13:07:28,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:07:28,117 INFO L225 Difference]: With dead ends: 81 [2018-11-28 13:07:28,118 INFO L226 Difference]: Without dead ends: 81 [2018-11-28 13:07:28,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 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 13:07:28,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-28 13:07:28,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-11-28 13:07:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 13:07:28,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2018-11-28 13:07:28,130 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 50 [2018-11-28 13:07:28,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:07:28,131 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-11-28 13:07:28,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:07:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2018-11-28 13:07:28,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 13:07:28,133 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:07:28,133 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 13:07:28,133 INFO L423 AbstractCegarLoop]: === Iteration 5 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:07:28,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:07:28,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1474040256, now seen corresponding path program 1 times [2018-11-28 13:07:28,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:07:28,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:07:28,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:28,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:07:28,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:28,646 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 13:07:28,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:07:28,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:07:28,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:07:28,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:07:28,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:07:28,649 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 5 states. [2018-11-28 13:07:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:07:28,916 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-28 13:07:28,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:07:28,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-28 13:07:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:07:28,919 INFO L225 Difference]: With dead ends: 85 [2018-11-28 13:07:28,919 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 13:07:28,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:07:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 13:07:28,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-11-28 13:07:28,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 13:07:28,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-11-28 13:07:28,928 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 50 [2018-11-28 13:07:28,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:07:28,929 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-11-28 13:07:28,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:07:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-11-28 13:07:28,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:07:28,932 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:07:28,932 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 13:07:28,933 INFO L423 AbstractCegarLoop]: === Iteration 6 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:07:28,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:07:28,933 INFO L82 PathProgramCache]: Analyzing trace with hash -963000911, now seen corresponding path program 1 times [2018-11-28 13:07:28,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:07:28,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:07:28,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:28,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:07:28,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:29,330 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 13:07:29,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:07:29,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:07:29,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:07:29,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:07:29,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:07:29,333 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 7 states. [2018-11-28 13:07:29,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:07:29,756 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-11-28 13:07:29,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:07:29,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-11-28 13:07:29,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:07:29,758 INFO L225 Difference]: With dead ends: 85 [2018-11-28 13:07:29,758 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 13:07:29,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:07:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 13:07:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-11-28 13:07:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 13:07:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-11-28 13:07:29,766 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 55 [2018-11-28 13:07:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:07:29,767 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-11-28 13:07:29,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:07:29,767 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-11-28 13:07:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 13:07:29,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:07:29,770 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 13:07:29,770 INFO L423 AbstractCegarLoop]: === Iteration 7 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:07:29,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:07:29,770 INFO L82 PathProgramCache]: Analyzing trace with hash 14257742, now seen corresponding path program 1 times [2018-11-28 13:07:29,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:07:29,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:07:29,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:29,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:07:29,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:30,162 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 13:07:30,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:07:30,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:07:30,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:07:30,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:07:30,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:07:30,165 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 6 states. [2018-11-28 13:07:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:07:30,876 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-11-28 13:07:30,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:07:30,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-11-28 13:07:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:07:30,880 INFO L225 Difference]: With dead ends: 85 [2018-11-28 13:07:30,880 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 13:07:30,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:07:30,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 13:07:30,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-11-28 13:07:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 13:07:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-11-28 13:07:30,889 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 57 [2018-11-28 13:07:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:07:30,890 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-11-28 13:07:30,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:07:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-11-28 13:07:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 13:07:30,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:07:30,899 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 13:07:30,899 INFO L423 AbstractCegarLoop]: === Iteration 8 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:07:30,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:07:30,899 INFO L82 PathProgramCache]: Analyzing trace with hash 14257743, now seen corresponding path program 1 times [2018-11-28 13:07:30,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:07:30,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:07:30,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:30,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:07:30,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:31,361 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 13:07:31,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:07:31,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:07:31,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:07:31,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:07:31,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:07:31,363 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-11-28 13:07:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:07:31,774 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-11-28 13:07:31,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 13:07:31,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-11-28 13:07:31,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:07:31,778 INFO L225 Difference]: With dead ends: 109 [2018-11-28 13:07:31,778 INFO L226 Difference]: Without dead ends: 109 [2018-11-28 13:07:31,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:07:31,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-28 13:07:31,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2018-11-28 13:07:31,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 13:07:31,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-11-28 13:07:31,784 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 57 [2018-11-28 13:07:31,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:07:31,785 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-11-28 13:07:31,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:07:31,785 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-11-28 13:07:31,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 13:07:31,786 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:07:31,786 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 13:07:31,788 INFO L423 AbstractCegarLoop]: === Iteration 9 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:07:31,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:07:31,789 INFO L82 PathProgramCache]: Analyzing trace with hash 64797246, now seen corresponding path program 1 times [2018-11-28 13:07:31,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:07:31,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:07:31,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:31,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:07:31,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:32,312 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 13:07:32,560 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 13:07:32,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:07:32,561 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 13:07:32,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:07:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:32,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:07:32,749 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 13:07:32,752 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 13:07:32,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:07:32,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:32,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:32,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-28 13:07:33,135 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:07:33,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:07:33,138 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 13:07:33,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:07:33,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:33,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2018-11-28 13:07:33,239 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 13:07:33,242 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 13:07:33,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:07:33,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:33,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:07:33,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2018-11-28 13:07:33,362 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 13:07:33,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:07:33,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-11-28 13:07:33,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 13:07:33,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 13:07:33,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-11-28 13:07:33,396 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 21 states. [2018-11-28 13:07:33,888 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2018-11-28 13:07:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:07:35,108 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-11-28 13:07:35,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 13:07:35,110 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-11-28 13:07:35,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:07:35,112 INFO L225 Difference]: With dead ends: 112 [2018-11-28 13:07:35,112 INFO L226 Difference]: Without dead ends: 112 [2018-11-28 13:07:35,113 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 13:07:35,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-28 13:07:35,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2018-11-28 13:07:35,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-28 13:07:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2018-11-28 13:07:35,121 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 57 [2018-11-28 13:07:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:07:35,123 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2018-11-28 13:07:35,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 13:07:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2018-11-28 13:07:35,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 13:07:35,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:07:35,124 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 13:07:35,125 INFO L423 AbstractCegarLoop]: === Iteration 10 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:07:35,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:07:35,126 INFO L82 PathProgramCache]: Analyzing trace with hash 64797247, now seen corresponding path program 1 times [2018-11-28 13:07:35,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:07:35,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:07:35,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:35,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:07:35,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:35,763 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 13:07:35,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:07:35,763 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 13:07:35,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:07:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:35,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:07:35,871 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 13:07:35,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:07:35,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:35,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 13:07:36,007 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 13:07:36,010 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 13:07:36,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:07:36,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:36,034 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 13:07:36,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 13:07:36,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:07:36,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:36,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:36,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-11-28 13:07:36,154 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 13:07:36,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:07:36,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:36,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-11-28 13:07:36,253 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 13:07:36,256 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 13:07:36,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:07:36,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:36,267 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 13:07:36,286 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 13:07:36,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:07:36,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:36,294 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 13:07:36,294 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:14 [2018-11-28 13:07:36,328 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 13:07:36,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:07:36,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 18 [2018-11-28 13:07:36,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:07:36,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:07:36,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:07:36,351 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 19 states. [2018-11-28 13:07:38,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:07:38,006 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-11-28 13:07:38,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 13:07:38,007 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-11-28 13:07:38,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:07:38,009 INFO L225 Difference]: With dead ends: 116 [2018-11-28 13:07:38,009 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 13:07:38,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2018-11-28 13:07:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 13:07:38,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2018-11-28 13:07:38,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-28 13:07:38,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2018-11-28 13:07:38,019 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 57 [2018-11-28 13:07:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:07:38,019 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2018-11-28 13:07:38,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:07:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2018-11-28 13:07:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 13:07:38,022 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:07:38,023 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 13:07:38,023 INFO L423 AbstractCegarLoop]: === Iteration 11 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:07:38,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:07:38,023 INFO L82 PathProgramCache]: Analyzing trace with hash 561616018, now seen corresponding path program 1 times [2018-11-28 13:07:38,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:07:38,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:07:38,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:38,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:07:38,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:38,557 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 13:07:38,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:07:38,557 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 13:07:38,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:07:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:38,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:07:38,799 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 13:07:38,801 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 13:07:38,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:07:38,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:38,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:38,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-28 13:07:38,950 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 13:07:38,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:07:38,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 20 [2018-11-28 13:07:38,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 13:07:38,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 13:07:38,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:07:38,974 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 20 states. [2018-11-28 13:07:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:07:40,415 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-11-28 13:07:40,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 13:07:40,416 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-11-28 13:07:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:07:40,418 INFO L225 Difference]: With dead ends: 112 [2018-11-28 13:07:40,418 INFO L226 Difference]: Without dead ends: 112 [2018-11-28 13:07:40,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2018-11-28 13:07:40,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-28 13:07:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-11-28 13:07:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 13:07:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-11-28 13:07:40,425 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 62 [2018-11-28 13:07:40,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:07:40,427 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-11-28 13:07:40,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 13:07:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-11-28 13:07:40,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 13:07:40,430 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:07:40,430 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 13:07:40,430 INFO L423 AbstractCegarLoop]: === Iteration 12 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:07:40,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:07:40,432 INFO L82 PathProgramCache]: Analyzing trace with hash 587278576, now seen corresponding path program 1 times [2018-11-28 13:07:40,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:07:40,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:07:40,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:40,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:07:40,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:40,989 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 13:07:40,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:07:40,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:07:40,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:07:40,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:07:40,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:07:40,992 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 6 states. [2018-11-28 13:07:41,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:07:41,405 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-11-28 13:07:41,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:07:41,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-28 13:07:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:07:41,408 INFO L225 Difference]: With dead ends: 98 [2018-11-28 13:07:41,408 INFO L226 Difference]: Without dead ends: 98 [2018-11-28 13:07:41,409 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 13:07:41,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-28 13:07:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2018-11-28 13:07:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-28 13:07:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-11-28 13:07:41,421 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 64 [2018-11-28 13:07:41,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:07:41,421 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-11-28 13:07:41,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:07:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-11-28 13:07:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 13:07:41,424 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:07:41,424 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 13:07:41,425 INFO L423 AbstractCegarLoop]: === Iteration 13 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:07:41,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:07:41,425 INFO L82 PathProgramCache]: Analyzing trace with hash 637818079, now seen corresponding path program 2 times [2018-11-28 13:07:41,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:07:41,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:07:41,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:41,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:07:41,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:42,284 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-28 13:07:42,650 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 13:07:42,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:07:42,650 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 13:07:42,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:07:42,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:07:42,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:07:42,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:07:42,944 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 13:07:42,960 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 13:07:42,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:07:42,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:42,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:42,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-28 13:07:43,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:07:43,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:07:43,077 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 13:07:43,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:07:43,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:43,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2018-11-28 13:07:43,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:07:43,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:43,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:43,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2018-11-28 13:07:43,303 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 13:07:43,335 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 13:07:43,509 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 13:07:43,524 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 13:07:43,525 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:07:43,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:43,548 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 13:07:43,549 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2018-11-28 13:07:44,102 WARN L180 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 13:07:44,665 WARN L180 SmtUtils]: Spent 506.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 13:07:44,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:07:44,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:07:44,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:07:44,683 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 34 treesize of output 70 [2018-11-28 13:07:44,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:07:44,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:07:44,718 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 66 treesize of output 81 [2018-11-28 13:07:44,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-28 13:07:44,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:07:44,728 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 13:07:44,729 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:07:44,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:44,756 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:44,780 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 13:07:44,781 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:102 [2018-11-28 13:07:45,031 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 74 treesize of output 64 [2018-11-28 13:07:45,035 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 64 treesize of output 51 [2018-11-28 13:07:45,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:07:45,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:07:45,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:07:45,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:72 [2018-11-28 13:07:45,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:07:45,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:07:45,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2018-11-28 13:07:45,473 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2018-11-28 13:07:45,475 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:07:45,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-28 13:07:45,501 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 13:07:45,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 13:07:45,522 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 13:07:45,522 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:67, output treesize:28 [2018-11-28 13:07:45,667 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 13:07:45,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:07:45,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 37 [2018-11-28 13:07:45,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-28 13:07:45,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-28 13:07:45,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1263, Unknown=0, NotChecked=0, Total=1406 [2018-11-28 13:07:45,699 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 38 states. [2018-11-28 13:07:47,711 WARN L180 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2018-11-28 13:07:48,823 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-11-28 13:07:50,653 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2018-11-28 13:07:51,815 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2018-11-28 13:07:53,652 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-11-28 13:07:54,862 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2018-11-28 13:07:57,010 WARN L180 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2018-11-28 13:07:58,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:07:58,104 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-11-28 13:07:58,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-28 13:07:58,105 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 64 [2018-11-28 13:07:58,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:07:58,106 INFO L225 Difference]: With dead ends: 128 [2018-11-28 13:07:58,106 INFO L226 Difference]: Without dead ends: 128 [2018-11-28 13:07:58,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=497, Invalid=3163, Unknown=0, NotChecked=0, Total=3660 [2018-11-28 13:07:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-28 13:07:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2018-11-28 13:07:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 13:07:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2018-11-28 13:07:58,114 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 64 [2018-11-28 13:07:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:07:58,115 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-11-28 13:07:58,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-28 13:07:58,115 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2018-11-28 13:07:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 13:07:58,115 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:07:58,118 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 13:07:58,119 INFO L423 AbstractCegarLoop]: === Iteration 14 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:07:58,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:07:58,119 INFO L82 PathProgramCache]: Analyzing trace with hash 637818080, now seen corresponding path program 2 times [2018-11-28 13:07:58,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:07:58,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:07:58,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:58,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:07:58,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:07:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:07:59,281 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2018-11-28 13:08:00,058 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 13:08:00,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:08:00,058 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 13:08:00,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:08:00,142 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:08:00,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:08:00,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:08:00,174 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 13:08:00,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:08:00,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:00,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 13:08:00,446 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 13:08:00,450 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 13:08:00,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:08:00,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:00,472 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 13:08:00,475 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 13:08:00,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:08:00,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:00,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:00,493 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-11-28 13:08:00,630 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 13:08:00,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:08:00,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:00,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2018-11-28 13:08:00,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:08:00,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:00,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:08:00,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:00,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:00,976 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2018-11-28 13:08:00,980 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 13:08:00,985 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 13:08:01,011 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 13:08:01,014 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 13:08:01,032 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 13:08:01,032 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:47 [2018-11-28 13:08:04,930 WARN L180 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 13:08:06,299 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 13:08:06,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:08:06,321 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 13:08:06,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:08:06,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:08:06,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:08:06,357 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 13:08:06,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:08:06,387 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 13:08:06,392 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 13:08:06,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:08:06,398 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 13:08:06,399 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:08:06,411 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:06,419 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:06,449 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 13:08:06,453 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 13:08:06,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:08:06,458 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 13:08:06,458 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:08:06,464 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:06,474 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:06,495 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 13:08:06,495 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:73, output treesize:67 [2018-11-28 13:08:06,939 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 13:08:06,942 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:08:06,943 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 13:08:06,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:08:06,958 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 13:08:06,959 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 13:08:06,969 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 13:08:06,994 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 13:08:07,018 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 13:08:07,019 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:08:07,048 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 13:08:07,048 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:08:07,051 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:07,060 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 13:08:07,061 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:88, output treesize:23 [2018-11-28 13:08:07,660 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 13:08:07,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:08:07,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 42 [2018-11-28 13:08:07,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-28 13:08:07,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-28 13:08:07,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1650, Unknown=2, NotChecked=0, Total=1806 [2018-11-28 13:08:07,684 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 43 states. [2018-11-28 13:08:12,056 WARN L180 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2018-11-28 13:08:20,418 WARN L180 SmtUtils]: Spent 8.26 s on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2018-11-28 13:08:23,925 WARN L180 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2018-11-28 13:08:27,885 WARN L180 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2018-11-28 13:08:36,149 WARN L180 SmtUtils]: Spent 8.16 s on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2018-11-28 13:08:40,553 WARN L180 SmtUtils]: Spent 3.76 s on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2018-11-28 13:08:49,286 WARN L180 SmtUtils]: Spent 8.63 s on a formula simplification. DAG size of input: 109 DAG size of output: 76 [2018-11-28 13:08:49,660 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2018-11-28 13:08:49,867 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2018-11-28 13:08:54,066 WARN L180 SmtUtils]: Spent 3.95 s on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2018-11-28 13:08:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:55,945 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2018-11-28 13:08:55,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-28 13:08:55,947 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 64 [2018-11-28 13:08:55,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:55,948 INFO L225 Difference]: With dead ends: 132 [2018-11-28 13:08:55,948 INFO L226 Difference]: Without dead ends: 132 [2018-11-28 13:08:55,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1192 ImplicationChecksByTransitivity, 54.1s TimeCoverageRelationStatistics Valid=636, Invalid=4192, Unknown=2, NotChecked=0, Total=4830 [2018-11-28 13:08:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-28 13:08:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 107. [2018-11-28 13:08:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-28 13:08:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2018-11-28 13:08:55,956 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 64 [2018-11-28 13:08:55,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:55,956 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2018-11-28 13:08:55,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-28 13:08:55,956 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2018-11-28 13:08:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 13:08:55,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:55,957 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 13:08:55,961 INFO L423 AbstractCegarLoop]: === Iteration 15 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:08:55,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:55,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1941419947, now seen corresponding path program 1 times [2018-11-28 13:08:55,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:55,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:55,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:55,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:08:55,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:56,522 WARN L180 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-11-28 13:08:56,613 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 13:08:56,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:56,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 13:08:56,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:08:56,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:08:56,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:08:56,614 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 12 states. [2018-11-28 13:08:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:56,997 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2018-11-28 13:08:56,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:08:56,998 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-28 13:08:56,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:57,000 INFO L225 Difference]: With dead ends: 108 [2018-11-28 13:08:57,000 INFO L226 Difference]: Without dead ends: 102 [2018-11-28 13:08:57,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-11-28 13:08:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-28 13:08:57,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-28 13:08:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 13:08:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-11-28 13:08:57,007 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 70 [2018-11-28 13:08:57,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:57,007 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-11-28 13:08:57,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:08:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-11-28 13:08:57,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 13:08:57,008 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:57,008 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 13:08:57,009 INFO L423 AbstractCegarLoop]: === Iteration 16 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:08:57,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:57,009 INFO L82 PathProgramCache]: Analyzing trace with hash 482244241, now seen corresponding path program 2 times [2018-11-28 13:08:57,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:57,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:57,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:57,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:57,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:58,272 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 13:08:58,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:08:58,273 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 13:08:58,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:08:58,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:08:58,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:08:58,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:08:58,594 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 13:08:58,597 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 13:08:58,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:08:58,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:58,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:58,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-28 13:08:58,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:08:58,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:58,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:58,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:30 [2018-11-28 13:08:58,835 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 13:08:58,843 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 13:08:58,858 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 13:08:58,861 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 13:08:58,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:08:58,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:08:58,875 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 13:08:58,875 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:34 [2018-11-28 13:09:00,002 WARN L180 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 13:09:00,818 WARN L180 SmtUtils]: Spent 756.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 13:09:00,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:00,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:00,827 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 13:09:00,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:00,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-28 13:09:00,916 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 13:09:00,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:00,922 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 13:09:00,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:00,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:00,935 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:00,948 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 13:09:00,948 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-11-28 13:09:01,754 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 13:09:01,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:01,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 22] total 53 [2018-11-28 13:09:01,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-28 13:09:01,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-28 13:09:01,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2565, Unknown=1, NotChecked=0, Total=2756 [2018-11-28 13:09:01,775 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 53 states. [2018-11-28 13:09:03,605 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-11-28 13:09:06,559 WARN L180 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2018-11-28 13:09:08,085 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2018-11-28 13:09:09,779 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-11-28 13:09:12,729 WARN L180 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-11-28 13:09:14,629 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2018-11-28 13:09:17,864 WARN L180 SmtUtils]: Spent 3.13 s on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2018-11-28 13:09:19,505 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2018-11-28 13:09:20,951 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2018-11-28 13:09:23,281 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2018-11-28 13:09:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:23,328 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-11-28 13:09:23,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-28 13:09:23,330 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 69 [2018-11-28 13:09:23,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:23,331 INFO L225 Difference]: With dead ends: 114 [2018-11-28 13:09:23,331 INFO L226 Difference]: Without dead ends: 114 [2018-11-28 13:09:23,334 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 13:09:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-28 13:09:23,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2018-11-28 13:09:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-28 13:09:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-11-28 13:09:23,338 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 69 [2018-11-28 13:09:23,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:23,338 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-11-28 13:09:23,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-28 13:09:23,341 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-28 13:09:23,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 13:09:23,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:23,342 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 13:09:23,343 INFO L423 AbstractCegarLoop]: === Iteration 17 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:09:23,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:23,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1670951710, now seen corresponding path program 3 times [2018-11-28 13:09:23,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:23,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:23,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:23,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:23,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:25,101 WARN L180 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2018-11-28 13:09:26,187 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 13:09:26,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:26,187 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 13:09:26,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 13:09:26,341 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 13:09:26,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:26,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:26,577 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 13:09:26,579 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 13:09:26,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:26,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:26,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:26,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-28 13:09:26,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:26,783 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:26,784 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 13:09:26,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:26,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:26,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2018-11-28 13:09:27,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:27,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:27,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:27,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2018-11-28 13:09:27,076 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 13:09:27,087 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 13:09:27,135 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 13:09:27,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 13:09:27,143 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:27,146 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:27,160 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 13:09:27,161 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2018-11-28 13:09:28,876 WARN L180 SmtUtils]: Spent 503.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 13:09:29,458 WARN L180 SmtUtils]: Spent 503.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 13:09:29,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:29,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:29,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:29,469 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 13:09:29,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:29,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:29,504 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 13:09:29,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-28 13:09:29,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:29,514 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 13:09:29,515 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:29,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:29,536 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:29,558 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 13:09:29,558 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:78 [2018-11-28 13:09:29,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:29,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:29,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:29,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:29,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:29,967 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2018-11-28 13:09:29,969 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 13:09:29,978 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 13:09:30,002 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 13:09:30,005 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 13:09:30,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 13:09:30,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:47 [2018-11-28 13:09:41,391 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 13:09:44,108 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 13:09:44,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:44,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:44,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:44,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:44,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:44,165 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 13:09:44,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:44,214 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 13:09:44,221 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 13:09:44,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:44,229 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 13:09:44,230 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:44,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:44,249 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:44,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:44,312 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:44,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:44,317 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:44,318 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 13:09:44,322 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 13:09:44,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:44,330 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 13:09:44,330 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:44,340 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:44,363 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:44,402 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 13:09:44,403 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:109, output treesize:146 [2018-11-28 13:09:44,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:44,881 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 53 treesize of output 43 [2018-11-28 13:09:44,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2018-11-28 13:09:44,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:44,898 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 13:09:44,898 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:44,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:44,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:09:44,926 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:157, output treesize:119 [2018-11-28 13:09:45,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:45,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:45,261 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:45,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:45,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:45,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:45,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 5 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 91 [2018-11-28 13:09:45,292 INFO L478 Elim1Store]: Elim1 applied some 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 58 [2018-11-28 13:09:45,299 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 13:09:45,418 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 13:09:45,418 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:45,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, 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 13:09:45,428 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 13:09:45,431 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 13:09:45,432 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:45,436 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 0 case distinctions, treesize of input 64 treesize of output 49 [2018-11-28 13:09:45,436 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:45,451 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 13:09:45,452 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-28 13:09:45,468 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 64 treesize of output 57 [2018-11-28 13:09:45,469 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-28 13:09:45,481 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 13:09:45,482 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 13:09:45,695 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 13:09:45,696 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 13:09:45,700 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 0 case distinctions, treesize of input 58 treesize of output 48 [2018-11-28 13:09:45,701 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 13:09:45,704 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 13:09:45,705 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 13:09:45,715 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 13:09:45,717 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 13:09:45,727 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 13:09:45,729 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 13:09:45,738 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 13:09:45,741 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 13:09:45,749 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 13:09:45,751 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 13:09:46,047 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 13:09:46,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 33 dim-0 vars, and 11 xjuncts. [2018-11-28 13:09:46,323 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:120, output treesize:496 [2018-11-28 13:09:47,543 WARN L180 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 29 [2018-11-28 13:09:47,922 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 13:09:47,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:47,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 53 [2018-11-28 13:09:47,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-28 13:09:47,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-28 13:09:47,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2608, Unknown=12, NotChecked=0, Total=2862 [2018-11-28 13:09:47,943 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 54 states. [2018-11-28 13:09:53,439 WARN L180 SmtUtils]: Spent 4.88 s on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2018-11-28 13:09:56,611 WARN L180 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2018-11-28 13:10:01,954 WARN L180 SmtUtils]: Spent 4.86 s on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-11-28 13:10:04,970 WARN L180 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2018-11-28 13:10:10,905 WARN L180 SmtUtils]: Spent 5.48 s on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2018-11-28 13:10:13,864 WARN L180 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2018-11-28 13:10:19,717 WARN L180 SmtUtils]: Spent 5.32 s on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2018-11-28 13:10:23,429 WARN L180 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2018-11-28 13:10:24,824 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2018-11-28 13:10:25,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:25,847 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-11-28 13:10:25,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-28 13:10:25,850 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 71 [2018-11-28 13:10:25,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:25,852 INFO L225 Difference]: With dead ends: 126 [2018-11-28 13:10:25,852 INFO L226 Difference]: Without dead ends: 126 [2018-11-28 13:10:25,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2036 ImplicationChecksByTransitivity, 57.3s TimeCoverageRelationStatistics Valid=782, Invalid=5848, Unknown=12, NotChecked=0, Total=6642 [2018-11-28 13:10:25,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-28 13:10:25,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2018-11-28 13:10:25,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-28 13:10:25,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-11-28 13:10:25,863 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 71 [2018-11-28 13:10:25,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:25,863 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-11-28 13:10:25,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-28 13:10:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-11-28 13:10:25,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 13:10:25,864 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:25,864 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 13:10:25,864 INFO L423 AbstractCegarLoop]: === Iteration 18 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:10:25,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:25,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1670951711, now seen corresponding path program 3 times [2018-11-28 13:10:25,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:25,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:25,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:25,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:25,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:26,210 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-11-28 13:10:26,464 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-11-28 13:10:26,912 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-11-28 13:10:28,282 WARN L180 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2018-11-28 13:10:28,926 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-28 13:10:29,461 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-11-28 13:10:31,195 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 13:10:31,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:10:31,195 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 13:10:31,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 13:10:31,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 13:10:31,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:10:31,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:31,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 13:10:31,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:31,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:31,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 13:10:31,567 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 13:10:31,570 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 13:10:31,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:31,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:31,591 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 13:10:31,594 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 13:10:31,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:31,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:31,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:31,611 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-28 13:10:31,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:31,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:31,823 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 13:10:31,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:31,842 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 18 treesize of output 27 [2018-11-28 13:10:31,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:31,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:31,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:55 [2018-11-28 13:10:32,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:32,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:32,408 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:32,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:32,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:32,431 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:87, output treesize:57 [2018-11-28 13:10:32,435 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 13:10:32,481 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 13:10:32,565 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 13:10:32,568 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 13:10:32,587 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 13:10:32,587 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:53 [2018-11-28 13:10:41,648 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 13:10:44,076 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 13:10:44,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:44,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:44,112 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 13:10:44,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:44,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:44,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:44,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:44,157 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 13:10:44,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:44,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:44,203 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 13:10:44,207 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 13:10:44,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:44,211 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 13:10:44,211 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:44,221 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:44,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:44,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:44,278 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 13:10:44,282 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 13:10:44,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:44,287 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 13:10:44,288 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:44,293 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:44,302 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:44,335 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 13:10:44,336 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:96, output treesize:122 [2018-11-28 13:10:44,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:44,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:44,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:44,739 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:44,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:44,756 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2018-11-28 13:10:44,759 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 13:10:44,771 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 13:10:44,788 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 13:10:44,793 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 13:10:44,807 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 13:10:44,807 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:47 [2018-11-28 13:11:02,160 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 13:11:04,386 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 13:11:04,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,400 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 13:11:04,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:04,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,466 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 13:11:04,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:04,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,520 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,524 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,526 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 13:11:04,530 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 13:11:04,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,536 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 13:11:04,537 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:04,551 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:04,579 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:04,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,646 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 13:11:04,649 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 13:11:04,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:04,660 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 13:11:04,661 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:04,666 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:04,682 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:04,718 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 13:11:04,718 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:147, output treesize:163 [2018-11-28 13:11:05,862 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:05,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:05,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:05,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:05,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:05,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:05,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:05,871 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 215 treesize of output 190 [2018-11-28 13:11:05,993 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:06,139 INFO L303 Elim1Store]: Index analysis took 266 ms [2018-11-28 13:11:06,307 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 101 treesize of output 107 [2018-11-28 13:11:06,314 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 13:11:06,490 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:06,499 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 112 treesize of output 122 [2018-11-28 13:11:06,500 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 13:11:06,531 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:06,540 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 102 treesize of output 112 [2018-11-28 13:11:06,541 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 13:11:06,545 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:06,546 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:06,550 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 112 treesize of output 118 [2018-11-28 13:11:06,551 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:06,555 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:06,556 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 90 treesize of output 80 [2018-11-28 13:11:06,556 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:06,562 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:06,571 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 96 treesize of output 106 [2018-11-28 13:11:06,573 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-28 13:11:06,575 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:06,577 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 96 treesize of output 86 [2018-11-28 13:11:06,577 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:06,581 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:06,592 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 106 treesize of output 116 [2018-11-28 13:11:06,594 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 13:11:06,919 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 85 treesize of output 73 [2018-11-28 13:11:06,920 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 13:11:06,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:06,926 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 101 treesize of output 91 [2018-11-28 13:11:06,927 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 13:11:06,937 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 91 treesize of output 85 [2018-11-28 13:11:06,939 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 13:11:06,949 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 95 treesize of output 89 [2018-11-28 13:11:06,952 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 13:11:06,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 73 [2018-11-28 13:11:06,973 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 13:11:06,981 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 91 treesize of output 85 [2018-11-28 13:11:06,984 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 13:11:07,033 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 101 treesize of output 95 [2018-11-28 13:11:07,036 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 13:11:07,495 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 13:11:07,914 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 80 treesize of output 68 [2018-11-28 13:11:07,918 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:07,919 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 13:11:07,919 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:07,949 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 13:11:07,950 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:07,975 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 13:11:07,975 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:07,994 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,002 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 80 treesize of output 68 [2018-11-28 13:11:08,006 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:08,007 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 13:11:08,007 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,035 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 13:11:08,035 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,059 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 13:11:08,060 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,079 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,086 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 80 treesize of output 68 [2018-11-28 13:11:08,090 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:08,091 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 13:11:08,091 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,119 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 13:11:08,119 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,142 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 13:11:08,143 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,162 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,168 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 80 treesize of output 68 [2018-11-28 13:11:08,171 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:08,172 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 13:11:08,172 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,201 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 13:11:08,201 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,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, 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 13:11:08,227 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,247 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,254 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 80 treesize of output 68 [2018-11-28 13:11:08,257 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:08,258 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 13:11:08,259 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,288 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 13:11:08,288 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,314 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 13:11:08,314 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,334 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,342 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 80 treesize of output 72 [2018-11-28 13:11:08,346 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 13:11:08,346 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,375 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:08,377 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 15 treesize of output 11 [2018-11-28 13:11:08,379 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,404 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 13:11:08,404 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,425 INFO L267 ElimStorePlain]: Start of recursive call 38: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,432 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 80 treesize of output 68 [2018-11-28 13:11:08,436 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 13:11:08,437 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,465 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:08,467 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 15 treesize of output 11 [2018-11-28 13:11:08,467 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,491 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 13:11:08,492 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,512 INFO L267 ElimStorePlain]: Start of recursive call 42: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,519 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 80 treesize of output 68 [2018-11-28 13:11:08,523 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 13:11:08,523 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,582 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:08,584 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 15 treesize of output 11 [2018-11-28 13:11:08,584 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,611 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 13:11:08,611 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,630 INFO L267 ElimStorePlain]: Start of recursive call 46: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,638 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 80 treesize of output 68 [2018-11-28 13:11:08,645 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:08,647 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 13:11:08,647 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,675 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 13:11:08,676 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,698 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 13:11:08,698 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,718 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,726 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 80 treesize of output 68 [2018-11-28 13:11:08,730 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 13:11:08,730 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,756 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 13:11:08,757 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,782 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 13:11:08,782 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,800 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,805 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 80 treesize of output 68 [2018-11-28 13:11:08,809 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 13:11:08,810 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,836 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 13:11:08,836 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,861 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 13:11:08,861 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:08,881 INFO L267 ElimStorePlain]: Start of recursive call 58: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:09,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 33 dim-0 vars, and 11 xjuncts. [2018-11-28 13:11:09,158 INFO L202 ElimStorePlain]: Needed 61 recursive calls to eliminate 3 variables, input treesize:227, output treesize:529 [2018-11-28 13:11:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 48 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:11:09,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:11:09,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 52 [2018-11-28 13:11:09,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-28 13:11:09,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-28 13:11:09,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2532, Unknown=20, NotChecked=0, Total=2756 [2018-11-28 13:11:09,668 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 53 states. [2018-11-28 13:11:16,006 WARN L180 SmtUtils]: Spent 5.47 s on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2018-11-28 13:11:19,490 WARN L180 SmtUtils]: Spent 3.41 s on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2018-11-28 13:11:26,432 WARN L180 SmtUtils]: Spent 6.17 s on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2018-11-28 13:11:29,957 WARN L180 SmtUtils]: Spent 3.45 s on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2018-11-28 13:11:35,753 WARN L180 SmtUtils]: Spent 5.04 s on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2018-11-28 13:11:39,492 WARN L180 SmtUtils]: Spent 3.66 s on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2018-11-28 13:11:45,504 WARN L180 SmtUtils]: Spent 5.13 s on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-11-28 13:11:49,321 WARN L180 SmtUtils]: Spent 3.73 s on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2018-11-28 13:11:49,705 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2018-11-28 13:11:50,045 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2018-11-28 13:11:50,660 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 106 [2018-11-28 13:11:50,925 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2018-11-28 13:11:51,266 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2018-11-28 13:11:51,646 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 109 [2018-11-28 13:11:51,912 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2018-11-28 13:11:52,316 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 103 [2018-11-28 13:11:52,722 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 108 [2018-11-28 13:11:52,974 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2018-11-28 13:11:53,634 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-11-28 13:11:54,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:54,645 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2018-11-28 13:11:54,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-28 13:11:54,647 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 71 [2018-11-28 13:11:54,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:54,649 INFO L225 Difference]: With dead ends: 127 [2018-11-28 13:11:54,649 INFO L226 Difference]: Without dead ends: 127 [2018-11-28 13:11:54,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 47 SyntacticMatches, 12 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1959 ImplicationChecksByTransitivity, 79.1s TimeCoverageRelationStatistics Valid=800, Invalid=6152, Unknown=20, NotChecked=0, Total=6972 [2018-11-28 13:11:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-28 13:11:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2018-11-28 13:11:54,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-28 13:11:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-11-28 13:11:54,657 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 71 [2018-11-28 13:11:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:54,660 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-11-28 13:11:54,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-28 13:11:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-11-28 13:11:54,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 13:11:54,661 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:54,664 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 13:11:54,664 INFO L423 AbstractCegarLoop]: === Iteration 19 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:11:54,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:54,665 INFO L82 PathProgramCache]: Analyzing trace with hash 246818738, now seen corresponding path program 3 times [2018-11-28 13:11:54,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:54,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:54,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:54,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:11:54,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:56,716 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-28 13:11:57,718 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 13:11:57,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:11:57,718 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 13:11:57,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 13:11:57,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 13:11:57,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:11:57,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:11:58,009 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 13:11:58,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:58,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:58,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-28 13:11:58,066 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 13:11:58,069 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 13:11:58,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:58,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:58,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:58,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-28 13:11:58,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:58,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:58,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:58,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2018-11-28 13:11:58,409 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 13:11:58,412 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 13:11:58,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:58,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:58,436 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 13:11:58,441 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 13:11:58,455 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 13:11:58,456 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2018-11-28 13:12:00,158 WARN L180 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 13:12:00,730 WARN L180 SmtUtils]: Spent 509.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 13:12:00,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:12:00,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:12:00,737 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 17 treesize of output 21 [2018-11-28 13:12:00,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:12:00,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-28 13:12:00,764 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 13:12:00,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:12:00,769 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 13:12:00,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:12:00,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:12:00,782 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:12:00,798 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 13:12:00,798 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:53 [2018-11-28 13:12:00,937 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 13:12:00,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:12:00,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:12:00,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-11-28 13:12:01,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:12:01,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:12:01,166 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:12:01,170 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:12:01,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:12:01,189 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:50 [2018-11-28 13:12:01,192 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 13:12:01,195 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 13:12:01,217 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 13:12:01,234 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 13:12:01,251 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 13:12:01,251 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:46 [2018-11-28 13:12:04,792 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 13:12:06,247 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 13:12:06,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:12:06,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:12:06,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:12:06,260 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-28 13:12:06,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:12:06,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:12:06,297 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 63 [2018-11-28 13:12:06,300 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 13:12:06,315 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:12:06,317 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 13:12:06,317 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:12:06,323 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:12:06,336 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:12:06,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:12:06,366 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 13:12:06,369 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 13:12:06,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:12:06,375 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 13:12:06,375 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:12:06,379 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:12:06,389 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:12:06,409 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 13:12:06,409 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:87, output treesize:83 [2018-11-28 13:12:07,595 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 13:12:07,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:12:07,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 29] total 68 [2018-11-28 13:12:07,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-11-28 13:12:07,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-11-28 13:12:07,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=4306, Unknown=3, NotChecked=0, Total=4556 [2018-11-28 13:12:07,619 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 68 states. [2018-11-28 13:12:26,748 WARN L180 SmtUtils]: Spent 4.43 s on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2018-11-28 13:12:32,605 WARN L180 SmtUtils]: Spent 5.60 s on a formula simplification. DAG size of input: 155 DAG size of output: 46 [2018-11-28 13:12:38,440 WARN L180 SmtUtils]: Spent 5.47 s on a formula simplification. DAG size of input: 115 DAG size of output: 40 [2018-11-28 13:12:53,119 WARN L180 SmtUtils]: Spent 4.79 s on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2018-11-28 13:12:58,716 WARN L180 SmtUtils]: Spent 5.38 s on a formula simplification. DAG size of input: 159 DAG size of output: 51 [2018-11-28 13:13:07,695 WARN L180 SmtUtils]: Spent 4.61 s on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2018-11-28 13:13:13,302 WARN L180 SmtUtils]: Spent 5.39 s on a formula simplification. DAG size of input: 170 DAG size of output: 59 [2018-11-28 13:13:15,084 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2018-11-28 13:13:17,963 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2018-11-28 13:13:24,820 WARN L180 SmtUtils]: Spent 5.17 s on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2018-11-28 13:13:30,915 WARN L180 SmtUtils]: Spent 5.87 s on a formula simplification. DAG size of input: 179 DAG size of output: 67 [2018-11-28 13:13:31,314 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2018-11-28 13:13:31,561 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2018-11-28 13:13:31,797 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2018-11-28 13:13:32,167 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2018-11-28 13:13:32,398 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2018-11-28 13:13:32,638 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2018-11-28 13:13:33,023 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2018-11-28 13:13:33,264 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2018-11-28 13:13:33,497 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2018-11-28 13:13:33,888 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2018-11-28 13:13:34,137 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2018-11-28 13:13:34,372 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2018-11-28 13:13:34,786 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2018-11-28 13:13:36,144 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2018-11-28 13:13:38,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:38,004 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-11-28 13:13:38,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-28 13:13:38,005 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 76 [2018-11-28 13:13:38,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:13:38,007 INFO L225 Difference]: With dead ends: 123 [2018-11-28 13:13:38,007 INFO L226 Difference]: Without dead ends: 123 [2018-11-28 13:13:38,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3431 ImplicationChecksByTransitivity, 76.4s TimeCoverageRelationStatistics Valid=1308, Invalid=10891, Unknown=11, NotChecked=0, Total=12210 [2018-11-28 13:13:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-28 13:13:38,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2018-11-28 13:13:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-28 13:13:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2018-11-28 13:13:38,016 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 76 [2018-11-28 13:13:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:13:38,018 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2018-11-28 13:13:38,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-11-28 13:13:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2018-11-28 13:13:38,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 13:13:38,019 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:13:38,019 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 13:13:38,021 INFO L423 AbstractCegarLoop]: === Iteration 20 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2018-11-28 13:13:38,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:38,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1234657281, now seen corresponding path program 4 times [2018-11-28 13:13:38,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:38,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:38,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:38,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:13:38,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:38,620 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 13:13:39,680 WARN L180 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2018-11-28 13:13:40,534 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-28 13:13:41,322 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2018-11-28 13:13:43,740 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 13:13:43,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:13:43,740 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 13:13:43,752 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 13:13:43,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 13:13:43,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:13:43,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:43,943 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 13:13:43,947 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 13:13:43,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:43,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:43,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:43,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-11-28 13:13:44,034 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 13:13:44,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:13:44,039 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 13:13:44,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:44,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:44,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:44,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2018-11-28 13:13:46,787 WARN L180 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 13:13:46,793 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 13:13:46,798 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 13:13:46,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:46,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:46,824 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 13:13:46,827 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 13:13:46,828 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:46,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:46,846 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 13:13:46,847 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-11-28 13:13:48,783 WARN L180 SmtUtils]: Spent 533.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 13:13:49,454 WARN L180 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 13:13:49,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:13:49,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:13:49,462 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 13:13:49,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:49,488 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 13:13:49,491 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 13:13:49,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:13:49,495 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 13:13:49,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:49,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:49,504 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:49,520 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 13:13:49,521 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:52 [2018-11-28 13:13:50,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:50,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:50,559 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:50,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:50,585 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 13:13:50,586 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:62 [2018-11-28 13:13:51,935 WARN L180 SmtUtils]: Spent 760.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-28 13:13:51,939 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 13:13:51,944 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 13:13:51,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 13:13:51,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 13:13:51,998 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 13:13:51,998 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:69 [2018-11-28 13:14:12,911 WARN L180 SmtUtils]: Spent 2.77 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 13:14:17,032 WARN L180 SmtUtils]: Spent 2.75 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 13:14:17,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:14:17,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:14:17,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:14:17,045 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 13:14:17,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:17,096 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 13:14:17,100 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 13:14:17,104 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:14:17,106 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 13:14:17,107 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:17,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:17,123 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:17,170 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 13:14:17,174 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 13:14:17,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:14:17,180 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 13:14:17,181 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:17,188 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:17,196 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:17,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:14:17,241 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 13:14:17,245 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 13:14:17,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:14:17,250 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 13:14:17,250 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:17,259 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:17,275 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:17,308 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 13:14:17,309 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:109, output treesize:108 [2018-11-28 13:14:17,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:17,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:17,870 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:17,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:17,890 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 13:14:17,891 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:56 [2018-11-28 13:14:21,392 WARN L180 SmtUtils]: Spent 744.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 13:14:21,396 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 13:14:21,400 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 13:14:21,423 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 13:14:21,427 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 13:14:21,444 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 13:14:21,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:63 [2018-11-28 13:14:54,896 WARN L180 SmtUtils]: Spent 2.76 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 13:15:00,914 WARN L180 SmtUtils]: Spent 3.00 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 13:15:00,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:00,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:00,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:00,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:00,953 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:00,953 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 13:15:00,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:01,007 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 13:15:01,011 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 13:15:01,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:01,017 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 13:15:01,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:01,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:01,033 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:01,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:01,085 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 13:15:01,089 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 13:15:01,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:01,094 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 13:15:01,095 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:01,103 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:01,121 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:01,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:01,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:01,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:01,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:01,176 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 13:15:01,181 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 13:15:01,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:01,187 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 13:15:01,187 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:01,200 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:01,226 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:01,260 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 13:15:01,260 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:151, output treesize:134 [2018-11-28 13:15:02,928 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:02,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:02,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:02,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:02,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:02,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:02,935 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:02,936 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 185 [2018-11-28 13:15:02,946 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:02,969 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 13:15:02,975 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 13:15:03,127 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:03,139 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 13:15:03,140 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 13:15:03,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:03,174 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:03,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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 13:15:03,178 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:03,181 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:03,192 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 13:15:03,193 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 13:15:03,238 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:03,255 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 13:15:03,257 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 13:15:03,260 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:03,261 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 13:15:03,262 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:03,265 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:03,267 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 13:15:03,268 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:03,272 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:03,283 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 13:15:03,285 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 13:15:03,587 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 13:15:03,589 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 13:15:03,592 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 13:15:03,593 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 13:15:03,597 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 13:15:03,598 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 13:15:03,610 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 13:15:03,612 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 13:15:03,623 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 13:15:03,625 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 13:15:03,635 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 13:15:03,638 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 13:15:03,641 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:03,643 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 13:15:03,645 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:15:04,047 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 13:15:04,395 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 13:15:04,398 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:04,399 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 13:15:04,400 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,438 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 13:15:04,438 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,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 13:15:04,459 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,475 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,483 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 13:15:04,486 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:04,488 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 13:15:04,488 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,510 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 13:15:04,511 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,531 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 13:15:04,531 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,548 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,556 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 64 [2018-11-28 13:15:04,559 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:04,560 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 13:15:04,560 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,585 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 13:15:04,586 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,603 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 13:15:04,603 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,618 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,625 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 13:15:04,629 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:04,631 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 13:15:04,632 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,653 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 13:15:04,653 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,673 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 13:15:04,674 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,690 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,698 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 64 [2018-11-28 13:15:04,701 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 13:15:04,701 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,725 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 13:15:04,726 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 13:15:04,745 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,771 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,778 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 13:15:04,783 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 13:15:04,783 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,806 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:04,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 13:15:04,807 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,828 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 13:15:04,828 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,844 INFO L267 ElimStorePlain]: Start of recursive call 38: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,877 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 13:15:04,879 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:04,881 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 13:15:04,881 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,904 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 13:15:04,904 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,925 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 13:15:04,925 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,940 INFO L267 ElimStorePlain]: Start of recursive call 42: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,947 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 13:15:04,951 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 13:15:04,951 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,974 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:04,976 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 15 treesize of output 11 [2018-11-28 13:15:04,976 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:04,997 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 13:15:04,997 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,013 INFO L267 ElimStorePlain]: Start of recursive call 46: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,021 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 13:15:05,024 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:05,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 19 treesize of output 15 [2018-11-28 13:15:05,027 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,053 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 13:15:05,054 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,075 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 13:15:05,075 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,092 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,100 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 64 [2018-11-28 13:15:05,103 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 13:15:05,103 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,126 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 13:15:05,127 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,147 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 13:15:05,148 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,164 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,170 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 13:15:05,174 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:15:05,175 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 13:15:05,176 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,200 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 13:15:05,201 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,220 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 13:15:05,220 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,236 INFO L267 ElimStorePlain]: Start of recursive call 58: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,448 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 13:15:05,448 INFO L202 ElimStorePlain]: Needed 61 recursive calls to eliminate 3 variables, input treesize:190, output treesize:14 [2018-11-28 13:15:05,674 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 13:15:05,675 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 13:15:05,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,683 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 13:15:05,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-28 13:15:05,937 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 13:15:05,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:15:05,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 70 [2018-11-28 13:15:05,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-28 13:15:05,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-28 13:15:05,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=4618, Unknown=42, NotChecked=0, Total=4830 [2018-11-28 13:15:05,963 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 70 states. [2018-11-28 13:15:20,883 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-11-28 13:15:38,959 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-11-28 13:16:03,054 WARN L180 SmtUtils]: Spent 9.57 s on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2018-11-28 13:16:14,000 WARN L180 SmtUtils]: Spent 10.34 s on a formula simplification. DAG size of input: 177 DAG size of output: 67 [2018-11-28 13:16:24,057 WARN L180 SmtUtils]: Spent 9.17 s on a formula simplification. DAG size of input: 128 DAG size of output: 61 [2018-11-28 13:16:32,376 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2018-11-28 13:16:40,593 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2018-11-28 13:16:46,125 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2018-11-28 13:17:00,264 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 70 [2018-11-28 13:17:04,757 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2018-11-28 13:17:11,230 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2018-11-28 13:17:19,874 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2018-11-28 13:17:24,411 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-11-28 13:17:31,364 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-11-28 13:17:31,828 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 113 [2018-11-28 13:17:32,467 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-11-28 13:17:33,319 WARN L180 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 142 [2018-11-28 13:17:33,781 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 124 [2018-11-28 13:17:34,372 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 121 [2018-11-28 13:17:35,071 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 144 [2018-11-28 13:17:35,493 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 121 [2018-11-28 13:17:36,072 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 123 [2018-11-28 13:17:36,733 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 141 [2018-11-28 13:17:37,143 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-11-28 13:17:37,683 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2018-11-28 13:17:38,072 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2018-11-28 13:17:45,596 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2018-11-28 13:17:53,274 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2018-11-28 13:17:55,676 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2018-11-28 13:17:55,972 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2018-11-28 13:17:56,316 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2018-11-28 13:17:56,650 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2018-11-28 13:17:56,895 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2018-11-28 13:17:57,207 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 98 [2018-11-28 13:17:57,432 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2018-11-28 13:17:57,669 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 92 [2018-11-28 13:17:57,926 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 98 [2018-11-28 13:17:58,113 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2018-11-28 13:17:58,327 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2018-11-28 13:17:58,535 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2018-11-28 13:17:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:58,537 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2018-11-28 13:17:58,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-28 13:17:58,537 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 78 [2018-11-28 13:17:58,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:58,538 INFO L225 Difference]: With dead ends: 128 [2018-11-28 13:17:58,538 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 13:17:58,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3048 ImplicationChecksByTransitivity, 175.7s TimeCoverageRelationStatistics Valid=933, Invalid=13996, Unknown=77, NotChecked=0, Total=15006 [2018-11-28 13:17:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 13:17:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 13:17:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 13:17:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 13:17:58,540 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2018-11-28 13:17:58,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:58,540 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:17:58,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-28 13:17:58,541 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:17:58,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 13:17:58,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:17:58 BoogieIcfgContainer [2018-11-28 13:17:58,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:17:58,547 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:17:58,547 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:17:58,547 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:17:58,548 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:07:25" (3/4) ... [2018-11-28 13:17:58,552 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 13:17:58,560 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 13:17:58,560 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure insert_list [2018-11-28 13:17:58,560 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 13:17:58,560 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-28 13:17:58,560 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure search_list [2018-11-28 13:17:58,567 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-28 13:17:58,567 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 13:17:58,567 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 13:17:58,611 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 13:17:58,612 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:17:58,613 INFO L168 Benchmark]: Toolchain (without parser) took 635252.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.0 MB). Free memory was 952.7 MB in the beginning and 794.1 MB in the end (delta: 158.6 MB). Peak memory consumption was 331.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:58,615 INFO L168 Benchmark]: CDTParser took 0.32 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 13:17:58,615 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:58,616 INFO L168 Benchmark]: Boogie Preprocessor took 95.22 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:58,616 INFO L168 Benchmark]: RCFGBuilder took 881.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:58,616 INFO L168 Benchmark]: TraceAbstraction took 633435.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 794.1 MB in the end (delta: 271.8 MB). Peak memory consumption was 320.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:58,617 INFO L168 Benchmark]: Witness Printer took 64.77 ms. Allocated memory is still 1.2 GB. Free memory was 794.1 MB in the beginning and 794.1 MB in the end (delta: 2.6 kB). Peak memory consumption was 2.6 kB. Max. memory is 11.5 GB. [2018-11-28 13:17:58,618 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.32 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 770.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.22 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 881.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 633435.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 794.1 MB in the end (delta: 271.8 MB). Peak memory consumption was 320.0 MB. Max. memory is 11.5 GB. * Witness Printer took 64.77 ms. Allocated memory is still 1.2 GB. Free memory was 794.1 MB in the beginning and 794.1 MB in the end (delta: 2.6 kB). Peak memory consumption was 2.6 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 635]: 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: 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: 638]: 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: 638]: 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: 651]: 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: 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, 633.3s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 437.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 965 SDtfs, 4377 SDslu, 5141 SDs, 0 SdLazy, 18386 SolverSat, 1233 SolverUnsat, 71 SolverUnknown, 0 SolverNotchecked, 125.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1414 GetRequests, 566 SyntacticMatches, 70 SemanticMatches, 778 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15561 ImplicationChecksByTransitivity, 487.0s 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, 193.1s InterpolantComputationTime, 1853 NumberOfCodeBlocks, 1849 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1822 ConstructedInterpolants, 115 QuantifiedInterpolants, 3672463 SizeOfPredicates, 233 NumberOfNonLiveVariables, 4301 ConjunctsInSsa, 915 ConjunctsInUnsatCore, 31 InterpolantComputations, 9 PerfectInterpolantSequences, 905/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...