./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/alternating_list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 34ebb1e4 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/list-properties/alternating_list-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.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 9c54128245d3ab9ad313da188c7be33f66027c6a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-34ebb1e [2019-11-21 16:21:41,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 16:21:41,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 16:21:41,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 16:21:41,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 16:21:41,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 16:21:41,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 16:21:41,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 16:21:41,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 16:21:41,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 16:21:41,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 16:21:41,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 16:21:41,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 16:21:41,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 16:21:41,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 16:21:41,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 16:21:41,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 16:21:41,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 16:21:41,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 16:21:41,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 16:21:41,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 16:21:41,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 16:21:41,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 16:21:41,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 16:21:41,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 16:21:41,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 16:21:41,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 16:21:41,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 16:21:41,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 16:21:41,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 16:21:41,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 16:21:41,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 16:21:41,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 16:21:41,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 16:21:41,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 16:21:41,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 16:21:41,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 16:21:41,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 16:21:41,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 16:21:41,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 16:21:41,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 16:21:41,550 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2019-11-21 16:21:41,578 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 16:21:41,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 16:21:41,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 16:21:41,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 16:21:41,581 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 16:21:41,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 16:21:41,581 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 16:21:41,582 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 16:21:41,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 16:21:41,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 16:21:41,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 16:21:41,583 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 16:21:41,584 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 16:21:41,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 16:21:41,584 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 16:21:41,585 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 16:21:41,585 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 16:21:41,585 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 16:21:41,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 16:21:41,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 16:21:41,586 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 16:21:41,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 16:21:41,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 16:21:41,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 16:21:41,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 16:21:41,587 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 16:21:41,588 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 16:21:41,588 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 16:21:41,588 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 9c54128245d3ab9ad313da188c7be33f66027c6a [2019-11-21 16:21:41,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 16:21:41,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 16:21:41,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 16:21:41,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 16:21:41,920 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 16:21:41,920 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-21 16:21:41,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2a3bbcd/8488519c31e94f6a90b68b369b654267/FLAG5a48b2363 [2019-11-21 16:21:42,489 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 16:21:42,490 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-21 16:21:42,510 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2a3bbcd/8488519c31e94f6a90b68b369b654267/FLAG5a48b2363 [2019-11-21 16:21:42,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2a3bbcd/8488519c31e94f6a90b68b369b654267 [2019-11-21 16:21:42,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 16:21:42,828 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 16:21:42,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 16:21:42,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 16:21:42,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 16:21:42,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:21:42" (1/1) ... [2019-11-21 16:21:42,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3312ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:42, skipping insertion in model container [2019-11-21 16:21:42,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:21:42" (1/1) ... [2019-11-21 16:21:42,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 16:21:42,903 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 16:21:43,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 16:21:43,337 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 16:21:43,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 16:21:43,460 INFO L205 MainTranslator]: Completed translation [2019-11-21 16:21:43,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:43 WrapperNode [2019-11-21 16:21:43,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 16:21:43,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 16:21:43,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 16:21:43,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 16:21:43,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:43" (1/1) ... [2019-11-21 16:21:43,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:43" (1/1) ... [2019-11-21 16:21:43,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:43" (1/1) ... [2019-11-21 16:21:43,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:43" (1/1) ... [2019-11-21 16:21:43,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:43" (1/1) ... [2019-11-21 16:21:43,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:43" (1/1) ... [2019-11-21 16:21:43,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:43" (1/1) ... [2019-11-21 16:21:43,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 16:21:43,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 16:21:43,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 16:21:43,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 16:21:43,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 16:21:43,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 16:21:43,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 16:21:43,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 16:21:43,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 16:21:43,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-21 16:21:43,592 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-21 16:21:43,592 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-21 16:21:43,592 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-21 16:21:43,592 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 16:21:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 16:21:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 16:21:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 16:21:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 16:21:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 16:21:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 16:21:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 16:21:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 16:21:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 16:21:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 16:21:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 16:21:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 16:21:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 16:21:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 16:21:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 16:21:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 16:21:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 16:21:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 16:21:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 16:21:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 16:21:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-21 16:21:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-21 16:21:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-21 16:21:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 16:21:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 16:21:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 16:21:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 16:21:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 16:21:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 16:21:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 16:21:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 16:21:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 16:21:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 16:21:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 16:21:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 16:21:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 16:21:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 16:21:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 16:21:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 16:21:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 16:21:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 16:21:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 16:21:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 16:21:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 16:21:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 16:21:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 16:21:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 16:21:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 16:21:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 16:21:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 16:21:43,603 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 16:21:43,603 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 16:21:43,603 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 16:21:43,603 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 16:21:43,604 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 16:21:43,604 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 16:21:43,604 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 16:21:43,604 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 16:21:43,604 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 16:21:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 16:21:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 16:21:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 16:21:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 16:21:43,606 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 16:21:43,606 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 16:21:43,606 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 16:21:43,606 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 16:21:43,606 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 16:21:43,607 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 16:21:43,607 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 16:21:43,607 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 16:21:43,608 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 16:21:43,608 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 16:21:43,608 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 16:21:43,608 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 16:21:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 16:21:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 16:21:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 16:21:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 16:21:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 16:21:43,610 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 16:21:43,610 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 16:21:43,610 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 16:21:43,610 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 16:21:43,610 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 16:21:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 16:21:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 16:21:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 16:21:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 16:21:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 16:21:43,612 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 16:21:43,612 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 16:21:43,612 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 16:21:43,612 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 16:21:43,612 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 16:21:43,612 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 16:21:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 16:21:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 16:21:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 16:21:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 16:21:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 16:21:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 16:21:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 16:21:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 16:21:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 16:21:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 16:21:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 16:21:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 16:21:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 16:21:43,615 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-21 16:21:43,615 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 16:21:43,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 16:21:43,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 16:21:43,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 16:21:43,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 16:21:43,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 16:21:43,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 16:21:43,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 16:21:43,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 16:21:43,992 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-21 16:21:44,359 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 16:21:44,360 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-21 16:21:44,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:21:44 BoogieIcfgContainer [2019-11-21 16:21:44,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 16:21:44,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 16:21:44,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 16:21:44,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 16:21:44,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:21:42" (1/3) ... [2019-11-21 16:21:44,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33483a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:21:44, skipping insertion in model container [2019-11-21 16:21:44,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:43" (2/3) ... [2019-11-21 16:21:44,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33483a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:21:44, skipping insertion in model container [2019-11-21 16:21:44,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:21:44" (3/3) ... [2019-11-21 16:21:44,375 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2019-11-21 16:21:44,386 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 16:21:44,396 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-21 16:21:44,416 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-21 16:21:44,439 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 16:21:44,439 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 16:21:44,439 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 16:21:44,440 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 16:21:44,440 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 16:21:44,440 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 16:21:44,440 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 16:21:44,440 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 16:21:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2019-11-21 16:21:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 16:21:44,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:44,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:44,487 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 16:21:44,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:44,494 INFO L82 PathProgramCache]: Analyzing trace with hash -655644872, now seen corresponding path program 1 times [2019-11-21 16:21:44,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:44,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1345897833] [2019-11-21 16:21:44,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:44,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 16:21:44,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:44,857 INFO L377 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 [2019-11-21 16:21:44,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:44,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:44,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:44,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 16:21:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:44,893 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:44,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:44,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1345897833] [2019-11-21 16:21:44,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:44,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-21 16:21:44,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320657400] [2019-11-21 16:21:44,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 16:21:44,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:44,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 16:21:44,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-21 16:21:44,943 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2019-11-21 16:21:45,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:45,308 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-11-21 16:21:45,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 16:21:45,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 16:21:45,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:45,319 INFO L225 Difference]: With dead ends: 99 [2019-11-21 16:21:45,319 INFO L226 Difference]: Without dead ends: 91 [2019-11-21 16:21:45,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-21 16:21:45,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-21 16:21:45,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2019-11-21 16:21:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-21 16:21:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-11-21 16:21:45,375 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 10 [2019-11-21 16:21:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:45,375 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-11-21 16:21:45,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 16:21:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-11-21 16:21:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 16:21:45,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:45,377 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:45,589 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:45,589 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 16:21:45,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:45,590 INFO L82 PathProgramCache]: Analyzing trace with hash -655644871, now seen corresponding path program 1 times [2019-11-21 16:21:45,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:45,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2011178696] [2019-11-21 16:21:45,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:45,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 16:21:45,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:45,797 INFO L377 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 [2019-11-21 16:21:45,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:45,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:45,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:45,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 16:21:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:45,836 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:45,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2011178696] [2019-11-21 16:21:45,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:45,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-21 16:21:45,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740373744] [2019-11-21 16:21:45,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 16:21:45,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:45,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 16:21:45,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 16:21:45,944 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 6 states. [2019-11-21 16:21:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:46,424 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-21 16:21:46,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 16:21:46,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-21 16:21:46,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:46,426 INFO L225 Difference]: With dead ends: 95 [2019-11-21 16:21:46,427 INFO L226 Difference]: Without dead ends: 95 [2019-11-21 16:21:46,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-21 16:21:46,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-21 16:21:46,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2019-11-21 16:21:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-21 16:21:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-11-21 16:21:46,439 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 10 [2019-11-21 16:21:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:46,440 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-11-21 16:21:46,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 16:21:46,440 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-11-21 16:21:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 16:21:46,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:46,441 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:46,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:46,654 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 16:21:46,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:46,654 INFO L82 PathProgramCache]: Analyzing trace with hash 952624162, now seen corresponding path program 1 times [2019-11-21 16:21:46,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:46,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [87571917] [2019-11-21 16:21:46,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:46,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 16:21:46,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:46,960 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:47,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [87571917] [2019-11-21 16:21:47,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:47,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 6 [2019-11-21 16:21:47,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18208100] [2019-11-21 16:21:47,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-21 16:21:47,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:47,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-21 16:21:47,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-21 16:21:47,010 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 7 states. [2019-11-21 16:21:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:47,362 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-11-21 16:21:47,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 16:21:47,364 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-21 16:21:47,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:47,365 INFO L225 Difference]: With dead ends: 91 [2019-11-21 16:21:47,365 INFO L226 Difference]: Without dead ends: 91 [2019-11-21 16:21:47,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-21 16:21:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-21 16:21:47,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2019-11-21 16:21:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-21 16:21:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2019-11-21 16:21:47,375 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 18 [2019-11-21 16:21:47,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:47,375 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2019-11-21 16:21:47,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-21 16:21:47,376 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2019-11-21 16:21:47,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 16:21:47,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:47,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:47,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:47,586 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 16:21:47,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:47,587 INFO L82 PathProgramCache]: Analyzing trace with hash -533376169, now seen corresponding path program 1 times [2019-11-21 16:21:47,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:47,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [439783689] [2019-11-21 16:21:47,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:47,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 16:21:47,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:47,768 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:47,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [439783689] [2019-11-21 16:21:47,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:47,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 16:21:47,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417172995] [2019-11-21 16:21:47,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 16:21:47,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:47,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 16:21:47,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 16:21:47,783 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 5 states. [2019-11-21 16:21:48,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:48,010 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-21 16:21:48,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 16:21:48,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-21 16:21:48,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:48,014 INFO L225 Difference]: With dead ends: 95 [2019-11-21 16:21:48,014 INFO L226 Difference]: Without dead ends: 95 [2019-11-21 16:21:48,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-21 16:21:48,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-21 16:21:48,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2019-11-21 16:21:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-21 16:21:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-11-21 16:21:48,023 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 19 [2019-11-21 16:21:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:48,024 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-11-21 16:21:48,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 16:21:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-11-21 16:21:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 16:21:48,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:48,025 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:48,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:48,227 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 16:21:48,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:48,228 INFO L82 PathProgramCache]: Analyzing trace with hash 439071551, now seen corresponding path program 1 times [2019-11-21 16:21:48,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:48,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1427266724] [2019-11-21 16:21:48,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:48,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-21 16:21:48,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:48,484 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 16:21:48,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:48,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:48,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:48,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-21 16:21:48,539 INFO L377 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 9 [2019-11-21 16:21:48,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:48,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:48,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:48,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-21 16:21:48,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:48,554 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:48,602 INFO L377 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 16 treesize of output 12 [2019-11-21 16:21:48,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-21 16:21:48,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:48,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-21 16:21:48,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-21 16:21:48,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:48,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1427266724] [2019-11-21 16:21:48,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:48,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-21 16:21:48,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78749686] [2019-11-21 16:21:48,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 16:21:48,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:48,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 16:21:48,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-21 16:21:48,643 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 11 states. [2019-11-21 16:21:49,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:49,546 INFO L93 Difference]: Finished difference Result 230 states and 246 transitions. [2019-11-21 16:21:49,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 16:21:49,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-21 16:21:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:49,549 INFO L225 Difference]: With dead ends: 230 [2019-11-21 16:21:49,549 INFO L226 Difference]: Without dead ends: 226 [2019-11-21 16:21:49,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-11-21 16:21:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-21 16:21:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 99. [2019-11-21 16:21:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-21 16:21:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2019-11-21 16:21:49,562 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 19 [2019-11-21 16:21:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:49,562 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2019-11-21 16:21:49,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 16:21:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2019-11-21 16:21:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 16:21:49,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:49,566 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:49,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:49,770 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 16:21:49,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:49,770 INFO L82 PathProgramCache]: Analyzing trace with hash 734896181, now seen corresponding path program 1 times [2019-11-21 16:21:49,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:49,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1528860240] [2019-11-21 16:21:49,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:49,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-21 16:21:49,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:49,921 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:49,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1528860240] [2019-11-21 16:21:49,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:49,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 16:21:49,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242602088] [2019-11-21 16:21:49,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 16:21:49,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:49,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 16:21:49,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 16:21:49,936 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand 4 states. [2019-11-21 16:21:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:49,951 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2019-11-21 16:21:49,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 16:21:49,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-21 16:21:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:49,953 INFO L225 Difference]: With dead ends: 145 [2019-11-21 16:21:49,953 INFO L226 Difference]: Without dead ends: 144 [2019-11-21 16:21:49,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 16:21:49,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-21 16:21:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 102. [2019-11-21 16:21:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-21 16:21:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2019-11-21 16:21:49,962 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 19 [2019-11-21 16:21:49,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:49,962 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2019-11-21 16:21:49,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 16:21:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2019-11-21 16:21:49,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 16:21:49,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:49,963 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:50,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:50,167 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 16:21:50,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:50,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1214032540, now seen corresponding path program 1 times [2019-11-21 16:21:50,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:50,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1946614237] [2019-11-21 16:21:50,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:50,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 16:21:50,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:50,400 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:50,401 INFO L377 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-21 16:21:50,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:50,433 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-21 16:21:50,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:50,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-21 16:21:50,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:21:50,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:50,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:50,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:50,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-11-21 16:21:50,509 INFO L377 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 21 treesize of output 9 [2019-11-21 16:21:50,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:50,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:50,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:21:50,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-11-21 16:21:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:50,549 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:50,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1946614237] [2019-11-21 16:21:50,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:50,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-21 16:21:50,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455880576] [2019-11-21 16:21:50,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 16:21:50,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:50,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 16:21:50,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-21 16:21:50,587 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand 8 states. [2019-11-21 16:21:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:51,135 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2019-11-21 16:21:51,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 16:21:51,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-21 16:21:51,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:51,139 INFO L225 Difference]: With dead ends: 115 [2019-11-21 16:21:51,140 INFO L226 Difference]: Without dead ends: 115 [2019-11-21 16:21:51,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-21 16:21:51,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-21 16:21:51,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2019-11-21 16:21:51,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-21 16:21:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2019-11-21 16:21:51,147 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 19 [2019-11-21 16:21:51,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:51,147 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2019-11-21 16:21:51,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 16:21:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2019-11-21 16:21:51,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 16:21:51,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:51,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:51,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:51,351 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 16:21:51,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:51,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1214032541, now seen corresponding path program 1 times [2019-11-21 16:21:51,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:51,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1051117459] [2019-11-21 16:21:51,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:51,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-21 16:21:51,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:51,546 INFO L377 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 [2019-11-21 16:21:51,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:51,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:51,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:51,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 16:21:51,584 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:21:51,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:51,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:51,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:21:51,610 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:51,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:51,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:51,628 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-21 16:21:51,656 INFO L377 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 23 treesize of output 11 [2019-11-21 16:21:51,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:51,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:51,673 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-21 16:21:51,674 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:51,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:51,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:51,680 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-11-21 16:21:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:51,718 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:51,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1051117459] [2019-11-21 16:21:51,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:51,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 16:21:51,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545298795] [2019-11-21 16:21:51,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 16:21:51,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:51,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 16:21:51,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-21 16:21:51,898 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 10 states. [2019-11-21 16:21:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:21:52,966 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-11-21 16:21:52,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 16:21:52,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-21 16:21:52,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:21:52,969 INFO L225 Difference]: With dead ends: 125 [2019-11-21 16:21:52,969 INFO L226 Difference]: Without dead ends: 125 [2019-11-21 16:21:52,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-21 16:21:52,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-21 16:21:52,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 93. [2019-11-21 16:21:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-21 16:21:52,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-11-21 16:21:52,975 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 19 [2019-11-21 16:21:52,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:21:52,976 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-11-21 16:21:52,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 16:21:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-11-21 16:21:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 16:21:52,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:21:52,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:21:53,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:53,180 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 16:21:53,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:21:53,181 INFO L82 PathProgramCache]: Analyzing trace with hash 643791046, now seen corresponding path program 1 times [2019-11-21 16:21:53,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:21:53,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1452481584] [2019-11-21 16:21:53,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:21:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:21:53,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 16:21:53,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:21:53,417 INFO L377 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 [2019-11-21 16:21:53,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:21:53,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:21:53,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:21:53,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 16:21:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:53,480 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:21:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:21:59,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1452481584] [2019-11-21 16:21:59,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:21:59,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 16:21:59,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349734848] [2019-11-21 16:21:59,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 16:21:59,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:21:59,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 16:21:59,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=64, Unknown=3, NotChecked=0, Total=90 [2019-11-21 16:21:59,606 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 10 states. [2019-11-21 16:22:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:22:00,074 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2019-11-21 16:22:00,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 16:22:00,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-21 16:22:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:22:00,076 INFO L225 Difference]: With dead ends: 111 [2019-11-21 16:22:00,076 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 16:22:00,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=44, Invalid=109, Unknown=3, NotChecked=0, Total=156 [2019-11-21 16:22:00,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 16:22:00,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2019-11-21 16:22:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-21 16:22:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2019-11-21 16:22:00,081 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 20 [2019-11-21 16:22:00,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:22:00,082 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2019-11-21 16:22:00,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 16:22:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2019-11-21 16:22:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 16:22:00,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:22:00,083 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:22:00,286 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:00,287 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 16:22:00,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:22:00,288 INFO L82 PathProgramCache]: Analyzing trace with hash 645208103, now seen corresponding path program 1 times [2019-11-21 16:22:00,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:22:00,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [123084493] [2019-11-21 16:22:00,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:22:00,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 16:22:00,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:22:00,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 16:22:00,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:00,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:00,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:00,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-21 16:22:00,616 INFO L377 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 9 [2019-11-21 16:22:00,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:00,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:00,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:00,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-21 16:22:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:22:00,637 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:22:00,738 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:00,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 56 [2019-11-21 16:22:00,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:00,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:00,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:00,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:00,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:00,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:00,833 INFO L567 ElimStorePlain]: treesize reduction 43, result has 25.9 percent of original size [2019-11-21 16:22:00,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-21 16:22:00,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2019-11-21 16:22:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:22:00,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [123084493] [2019-11-21 16:22:00,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:22:00,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-21 16:22:00,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5457516] [2019-11-21 16:22:00,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 16:22:00,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:22:00,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 16:22:00,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-21 16:22:00,860 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 13 states. [2019-11-21 16:22:01,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:22:01,428 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2019-11-21 16:22:01,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 16:22:01,429 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-11-21 16:22:01,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:22:01,430 INFO L225 Difference]: With dead ends: 112 [2019-11-21 16:22:01,430 INFO L226 Difference]: Without dead ends: 105 [2019-11-21 16:22:01,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-11-21 16:22:01,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-21 16:22:01,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2019-11-21 16:22:01,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-21 16:22:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-11-21 16:22:01,436 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 20 [2019-11-21 16:22:01,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:22:01,436 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-11-21 16:22:01,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 16:22:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-11-21 16:22:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-21 16:22:01,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:22:01,438 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:22:01,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:01,641 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 16:22:01,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:22:01,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1812033750, now seen corresponding path program 1 times [2019-11-21 16:22:01,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:22:01,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [778532073] [2019-11-21 16:22:01,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:22:01,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-21 16:22:01,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:22:01,883 INFO L377 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 [2019-11-21 16:22:01,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:01,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:01,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:01,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 16:22:01,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 16:22:01,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:01,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:01,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:01,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-21 16:22:01,955 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:01,956 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 16:22:01,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:01,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:01,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:01,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-21 16:22:01,999 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_23|], 2=[|v_#memory_int_25|]} [2019-11-21 16:22:02,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:22:02,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:02,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:02,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:22:02,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-21 16:22:02,043 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:02,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:02,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:02,062 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-11-21 16:22:02,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-21 16:22:02,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:02,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:02,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:02,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-21 16:22:02,186 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-21 16:22:02,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:02,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:02,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 16:22:02,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2019-11-21 16:22:02,273 INFO L377 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 26 treesize of output 14 [2019-11-21 16:22:02,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:02,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:02,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:02,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:9 [2019-11-21 16:22:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:22:02,308 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:22:02,527 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:22:02,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:02,532 INFO L496 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. [2019-11-21 16:22:02,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:36 [2019-11-21 16:22:04,792 INFO L377 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 274 treesize of output 266 [2019-11-21 16:22:04,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-21 16:22:04,995 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2019-11-21 16:22:04,996 INFO L567 ElimStorePlain]: treesize reduction 217, result has 15.6 percent of original size [2019-11-21 16:22:04,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:04,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-21 16:22:05,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:21 [2019-11-21 16:22:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:22:05,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [778532073] [2019-11-21 16:22:05,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 16:22:05,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-21 16:22:05,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589388605] [2019-11-21 16:22:05,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-21 16:22:05,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:22:05,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-21 16:22:05,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=388, Unknown=1, NotChecked=0, Total=462 [2019-11-21 16:22:05,281 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 22 states. [2019-11-21 16:22:06,713 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-11-21 16:22:07,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:22:07,692 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-11-21 16:22:07,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-21 16:22:07,693 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2019-11-21 16:22:07,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:22:07,694 INFO L225 Difference]: With dead ends: 101 [2019-11-21 16:22:07,694 INFO L226 Difference]: Without dead ends: 97 [2019-11-21 16:22:07,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=259, Invalid=1000, Unknown=1, NotChecked=0, Total=1260 [2019-11-21 16:22:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-21 16:22:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2019-11-21 16:22:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-21 16:22:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2019-11-21 16:22:07,699 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 29 [2019-11-21 16:22:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:22:07,700 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2019-11-21 16:22:07,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-21 16:22:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2019-11-21 16:22:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-21 16:22:07,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:22:07,702 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:22:07,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:07,905 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 16:22:07,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:22:07,906 INFO L82 PathProgramCache]: Analyzing trace with hash -306007361, now seen corresponding path program 1 times [2019-11-21 16:22:07,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:22:07,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1057023303] [2019-11-21 16:22:07,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:22:08,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-21 16:22:08,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:22:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 16:22:08,125 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:22:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 16:22:08,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1057023303] [2019-11-21 16:22:08,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 16:22:08,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-21 16:22:08,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63900836] [2019-11-21 16:22:08,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 16:22:08,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:22:08,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 16:22:08,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 16:22:08,136 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 3 states. [2019-11-21 16:22:08,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:22:08,152 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2019-11-21 16:22:08,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 16:22:08,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-21 16:22:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:22:08,154 INFO L225 Difference]: With dead ends: 122 [2019-11-21 16:22:08,154 INFO L226 Difference]: Without dead ends: 122 [2019-11-21 16:22:08,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 16:22:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-21 16:22:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2019-11-21 16:22:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-21 16:22:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2019-11-21 16:22:08,160 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 37 [2019-11-21 16:22:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:22:08,160 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2019-11-21 16:22:08,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 16:22:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2019-11-21 16:22:08,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-21 16:22:08,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:22:08,165 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:22:08,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:08,366 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 16:22:08,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:22:08,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1059552773, now seen corresponding path program 1 times [2019-11-21 16:22:08,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:22:08,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1497637159] [2019-11-21 16:22:08,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:22:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:22:08,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-21 16:22:08,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:22:08,662 INFO L377 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 [2019-11-21 16:22:08,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:08,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:08,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:08,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 16:22:08,707 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:08,707 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 16:22:08,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:08,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:08,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:08,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-21 16:22:08,752 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:22:08,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:08,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:08,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:08,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-21 16:22:17,105 WARN L192 SmtUtils]: Spent 8.20 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-21 16:22:17,105 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:17,106 INFO L377 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 1 case distinctions, treesize of input 35 treesize of output 51 [2019-11-21 16:22:17,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:17,141 INFO L567 ElimStorePlain]: treesize reduction 34, result has 39.3 percent of original size [2019-11-21 16:22:17,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:17,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2019-11-21 16:22:17,168 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:17,168 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 16:22:17,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:17,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:17,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:17,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2019-11-21 16:22:17,252 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:17,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 60 [2019-11-21 16:22:17,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:22:17,327 INFO L567 ElimStorePlain]: treesize reduction 34, result has 46.9 percent of original size [2019-11-21 16:22:17,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:22:17,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2019-11-21 16:22:17,562 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:22:17,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 133 [2019-11-21 16:22:17,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:17,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:17,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:17,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:17,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:22:17,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:22:17,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 15 xjuncts. [2019-11-21 16:23:17,157 WARN L192 SmtUtils]: Spent 59.57 s on a formula simplification. DAG size of input: 74 DAG size of output: 33 [2019-11-21 16:23:17,157 INFO L567 ElimStorePlain]: treesize reduction 2178, result has 6.9 percent of original size [2019-11-21 16:23:17,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 16:23:17,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:92, output treesize:125 [2019-11-21 16:23:17,276 INFO L377 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 27 treesize of output 15 [2019-11-21 16:23:17,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:23:17,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:23:17,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:23:17,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:5 [2019-11-21 16:23:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:23:17,338 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:23:17,435 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:23:17,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:23:17,440 INFO L496 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. [2019-11-21 16:23:17,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:19 [2019-11-21 16:23:18,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:23:18,586 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2019-11-21 16:23:18,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:18,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:23:18,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:23:18,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 16:23:18,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2019-11-21 16:23:27,306 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:23:27,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:23:27,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-21 16:23:27,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:50 [2019-11-21 16:23:47,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:23:47,587 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 16:23:47,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:23:47,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:23:47,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-21 16:23:47,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:86, output treesize:77 [2019-11-21 16:23:48,563 INFO L377 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 1694 treesize of output 1670 [2019-11-21 16:23:48,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:48,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:48,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-21 16:23:50,232 WARN L192 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 120 DAG size of output: 47 [2019-11-21 16:23:50,232 INFO L567 ElimStorePlain]: treesize reduction 52159, result has 0.2 percent of original size [2019-11-21 16:23:50,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:50,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:50,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:50,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:50,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:50,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:50,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:50,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:50,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:50,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:50,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:50,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:50,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:50,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:50,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:50,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:50,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:50,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:50,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:50,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:23:50,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:50,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-21 16:23:50,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:87, output treesize:15 [2019-11-21 16:23:50,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 16:23:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:23:58,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1497637159] [2019-11-21 16:23:58,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 16:23:58,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2019-11-21 16:23:58,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563853753] [2019-11-21 16:23:58,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-21 16:23:58,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:23:58,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-21 16:23:58,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=714, Unknown=15, NotChecked=0, Total=812 [2019-11-21 16:23:58,683 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 29 states. [2019-11-21 16:24:09,987 WARN L192 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-11-21 16:24:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:24:10,702 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2019-11-21 16:24:10,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-21 16:24:10,703 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-11-21 16:24:10,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:24:10,705 INFO L225 Difference]: With dead ends: 153 [2019-11-21 16:24:10,705 INFO L226 Difference]: Without dead ends: 153 [2019-11-21 16:24:10,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 44.7s TimeCoverageRelationStatistics Valid=303, Invalid=1844, Unknown=15, NotChecked=0, Total=2162 [2019-11-21 16:24:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-21 16:24:10,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 108. [2019-11-21 16:24:10,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-21 16:24:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-11-21 16:24:10,710 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 37 [2019-11-21 16:24:10,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:24:10,710 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-11-21 16:24:10,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-21 16:24:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2019-11-21 16:24:10,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-21 16:24:10,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 16:24:10,712 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 16:24:10,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:24:10,915 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 16:24:10,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 16:24:10,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1059552774, now seen corresponding path program 1 times [2019-11-21 16:24:10,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 16:24:10,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [772530715] [2019-11-21 16:24:10,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:24:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 16:24:11,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-21 16:24:11,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 16:24:11,188 INFO L377 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 [2019-11-21 16:24:11,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:11,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 16:24:11,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 16:24:11,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:11,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-21 16:24:11,266 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:11,267 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 16:24:11,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:11,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-21 16:24:11,300 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_40|], 2=[|v_#memory_int_40|]} [2019-11-21 16:24:11,306 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 16:24:11,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:11,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:24:11,340 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-21 16:24:11,341 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:11,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,360 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-11-21 16:24:11,390 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-21 16:24:11,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:11,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2019-11-21 16:24:11,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-21 16:24:11,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:11,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-21 16:24:11,524 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:11,524 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 16:24:11,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:11,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-11-21 16:24:11,570 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_41|], 6=[|v_#memory_int_42|]} [2019-11-21 16:24:11,576 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2019-11-21 16:24:11,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:11,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 16:24:11,613 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2019-11-21 16:24:11,614 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:11,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,634 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:34 [2019-11-21 16:24:11,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 8 [2019-11-21 16:24:11,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:11,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 16:24:11,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:28 [2019-11-21 16:24:11,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:11,844 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 54 [2019-11-21 16:24:11,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:24:11,917 INFO L567 ElimStorePlain]: treesize reduction 16, result has 72.9 percent of original size [2019-11-21 16:24:11,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:24:11,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-21 16:24:11,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:43 [2019-11-21 16:24:11,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:24:11,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:24:12,097 INFO L377 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 24 treesize of output 12 [2019-11-21 16:24:12,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:24:12,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:12,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 16:24:12,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-11-21 16:24:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:24:12,141 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 16:24:12,255 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:24:12,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:12,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:24:12,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:20 [2019-11-21 16:24:14,367 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-21 16:24:20,457 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-21 16:24:26,566 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-21 16:24:26,579 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:26,579 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 16:24:26,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 16:24:26,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:26,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 16:24:26,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:33 [2019-11-21 16:24:26,706 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 16:24:26,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 16:24:26,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-21 16:24:26,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:43 [2019-11-21 16:24:33,056 INFO L377 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 3002 treesize of output 2970 [2019-11-21 16:24:33,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-21 16:24:34,113 WARN L192 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 117 DAG size of output: 44 [2019-11-21 16:24:34,114 INFO L567 ElimStorePlain]: treesize reduction 2845, result has 2.3 percent of original size [2019-11-21 16:24:34,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:24:34,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:24:34,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:24:34,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 16:24:34,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-11-21 16:24:34,118 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-11-21 16:24:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 16:24:34,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [772530715] [2019-11-21 16:24:34,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 16:24:34,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2019-11-21 16:24:34,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205692036] [2019-11-21 16:24:34,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-21 16:24:34,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 16:24:34,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-21 16:24:34,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=678, Unknown=6, NotChecked=0, Total=812 [2019-11-21 16:24:34,370 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 29 states. [2019-11-21 16:24:36,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 16:24:36,819 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-21 16:24:36,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-21 16:24:36,820 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-11-21 16:24:36,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 16:24:36,820 INFO L225 Difference]: With dead ends: 60 [2019-11-21 16:24:36,820 INFO L226 Difference]: Without dead ends: 0 [2019-11-21 16:24:36,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=359, Invalid=1441, Unknown=6, NotChecked=0, Total=1806 [2019-11-21 16:24:36,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-21 16:24:36,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-21 16:24:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-21 16:24:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-21 16:24:36,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-21 16:24:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 16:24:36,822 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-21 16:24:36,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-21 16:24:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-21 16:24:36,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-21 16:24:37,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 16:24:37,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:24:37 BoogieIcfgContainer [2019-11-21 16:24:37,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-21 16:24:37,030 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-21 16:24:37,030 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-21 16:24:37,030 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-21 16:24:37,031 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:21:44" (3/4) ... [2019-11-21 16:24:37,034 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-21 16:24:37,039 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-21 16:24:37,039 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-21 16:24:37,039 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-21 16:24:37,040 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-21 16:24:37,040 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-21 16:24:37,040 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-21 16:24:37,040 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-21 16:24:37,041 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-21 16:24:37,051 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-21 16:24:37,052 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-21 16:24:37,052 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-21 16:24:37,052 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-21 16:24:37,100 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-21 16:24:37,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-21 16:24:37,101 INFO L168 Benchmark]: Toolchain (without parser) took 174273.44 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 232.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -138.8 MB). Peak memory consumption was 94.0 MB. Max. memory is 11.5 GB. [2019-11-21 16:24:37,102 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 16:24:37,102 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -124.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-21 16:24:37,102 INFO L168 Benchmark]: Boogie Preprocessor took 71.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 16:24:37,103 INFO L168 Benchmark]: RCFGBuilder took 828.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. [2019-11-21 16:24:37,103 INFO L168 Benchmark]: TraceAbstraction took 172663.68 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 131.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -80.6 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. [2019-11-21 16:24:37,103 INFO L168 Benchmark]: Witness Printer took 70.51 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2019-11-21 16:24:37,105 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 632.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -124.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 828.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 172663.68 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 131.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -80.6 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. * Witness Printer took 70.51 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 95 locations, 29 error locations. Result: SAFE, OverallTime: 172.5s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 630 SDtfs, 2269 SDslu, 2293 SDs, 0 SdLazy, 2973 SolverSat, 432 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 690 GetRequests, 469 SyntacticMatches, 12 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 79.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 361 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 144.5s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 598 ConstructedInterpolants, 62 QuantifiedInterpolants, 153827 SizeOfPredicates, 122 NumberOfNonLiveVariables, 1178 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 34/74 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...