./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/alternating_list-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 264dba86 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-64bit-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 64bit --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-264dba8 [2019-11-21 14:20:40,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 14:20:40,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 14:20:40,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 14:20:40,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 14:20:40,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 14:20:40,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 14:20:40,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 14:20:40,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 14:20:40,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 14:20:40,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 14:20:40,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 14:20:40,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 14:20:40,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 14:20:40,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 14:20:40,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 14:20:40,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 14:20:40,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 14:20:40,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 14:20:40,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 14:20:40,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 14:20:41,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 14:20:41,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 14:20:41,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 14:20:41,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 14:20:41,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 14:20:41,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 14:20:41,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 14:20:41,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 14:20:41,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 14:20:41,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 14:20:41,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 14:20:41,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 14:20:41,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 14:20:41,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 14:20:41,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 14:20:41,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 14:20:41,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 14:20:41,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 14:20:41,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 14:20:41,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 14:20:41,017 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-64bit-Automizer_Bitvector.epf [2019-11-21 14:20:41,032 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 14:20:41,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 14:20:41,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 14:20:41,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 14:20:41,034 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 14:20:41,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 14:20:41,035 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 14:20:41,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 14:20:41,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 14:20:41,036 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 14:20:41,036 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 14:20:41,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 14:20:41,037 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 14:20:41,037 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 14:20:41,037 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 14:20:41,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 14:20:41,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 14:20:41,038 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 14:20:41,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 14:20:41,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 14:20:41,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 14:20:41,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 14:20:41,040 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 14:20:41,040 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 14:20:41,041 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 14:20:41,041 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c54128245d3ab9ad313da188c7be33f66027c6a [2019-11-21 14:20:41,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 14:20:41,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 14:20:41,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 14:20:41,398 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 14:20:41,398 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 14:20:41,399 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 14:20:41,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeb4128e4/357be3b0e5b04dbdafd5e75fa47a1211/FLAGde00a9bf5 [2019-11-21 14:20:42,014 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 14:20:42,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-21 14:20:42,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeb4128e4/357be3b0e5b04dbdafd5e75fa47a1211/FLAGde00a9bf5 [2019-11-21 14:20:42,274 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeb4128e4/357be3b0e5b04dbdafd5e75fa47a1211 [2019-11-21 14:20:42,278 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 14:20:42,279 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 14:20:42,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 14:20:42,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 14:20:42,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 14:20:42,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:20:42" (1/1) ... [2019-11-21 14:20:42,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2760d580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:20:42, skipping insertion in model container [2019-11-21 14:20:42,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:20:42" (1/1) ... [2019-11-21 14:20:42,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 14:20:42,355 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 14:20:42,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 14:20:42,810 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 14:20:42,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 14:20:42,917 INFO L205 MainTranslator]: Completed translation [2019-11-21 14:20:42,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:20:42 WrapperNode [2019-11-21 14:20:42,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 14:20:42,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 14:20:42,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 14:20:42,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 14:20:42,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:20:42" (1/1) ... [2019-11-21 14:20:42,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:20:42" (1/1) ... [2019-11-21 14:20:42,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:20:42" (1/1) ... [2019-11-21 14:20:42,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:20:42" (1/1) ... [2019-11-21 14:20:42,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:20:42" (1/1) ... [2019-11-21 14:20:42,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:20:42" (1/1) ... [2019-11-21 14:20:42,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:20:42" (1/1) ... [2019-11-21 14:20:43,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 14:20:43,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 14:20:43,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 14:20:43,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 14:20:43,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:20:42" (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 14:20:43,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 14:20:43,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 14:20:43,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 14:20:43,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 14:20:43,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-21 14:20:43,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-21 14:20:43,067 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-21 14:20:43,067 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-21 14:20:43,067 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 14:20:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 14:20:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 14:20:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 14:20:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 14:20:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 14:20:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 14:20:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 14:20:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 14:20:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 14:20:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 14:20:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 14:20:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 14:20:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 14:20:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 14:20:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 14:20:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 14:20:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 14:20:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 14:20:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 14:20:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 14:20:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-21 14:20:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-21 14:20:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-21 14:20:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 14:20:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 14:20:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 14:20:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 14:20:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 14:20:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 14:20:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 14:20:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 14:20:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 14:20:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 14:20:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 14:20:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 14:20:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 14:20:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 14:20:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 14:20:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 14:20:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 14:20:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 14:20:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 14:20:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 14:20:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 14:20:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 14:20:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 14:20:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 14:20:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 14:20:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 14:20:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 14:20:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 14:20:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 14:20:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 14:20:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 14:20:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 14:20:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 14:20:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 14:20:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 14:20:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 14:20:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 14:20:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 14:20:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 14:20:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 14:20:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 14:20:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 14:20:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 14:20:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 14:20:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 14:20:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 14:20:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 14:20:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 14:20:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 14:20:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 14:20:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 14:20:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 14:20:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 14:20:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 14:20:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 14:20:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 14:20:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 14:20:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 14:20:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 14:20:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 14:20:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 14:20:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 14:20:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 14:20:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 14:20:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 14:20:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 14:20:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 14:20:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 14:20:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 14:20:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 14:20:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 14:20:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 14:20:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 14:20:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 14:20:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 14:20:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 14:20:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 14:20:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 14:20:43,083 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 14:20:43,083 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 14:20:43,083 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 14:20:43,083 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 14:20:43,083 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 14:20:43,083 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 14:20:43,083 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 14:20:43,083 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 14:20:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-21 14:20:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 14:20:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 14:20:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 14:20:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 14:20:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 14:20:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 14:20:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 14:20:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 14:20:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 14:20:43,462 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-21 14:20:43,871 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 14:20:43,872 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-21 14:20:43,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:20:43 BoogieIcfgContainer [2019-11-21 14:20:43,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 14:20:43,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 14:20:43,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 14:20:43,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 14:20:43,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 02:20:42" (1/3) ... [2019-11-21 14:20:43,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f32ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:20:43, skipping insertion in model container [2019-11-21 14:20:43,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:20:42" (2/3) ... [2019-11-21 14:20:43,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f32ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:20:43, skipping insertion in model container [2019-11-21 14:20:43,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:20:43" (3/3) ... [2019-11-21 14:20:43,885 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2019-11-21 14:20:43,897 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 14:20:43,908 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-21 14:20:43,922 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-21 14:20:43,946 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 14:20:43,946 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 14:20:43,955 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 14:20:43,956 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 14:20:43,956 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 14:20:43,956 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 14:20:43,956 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 14:20:43,956 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 14:20:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2019-11-21 14:20:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 14:20:43,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:20:44,000 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:20:44,002 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 14:20:44,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:20:44,009 INFO L82 PathProgramCache]: Analyzing trace with hash -655644872, now seen corresponding path program 1 times [2019-11-21 14:20:44,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:20:44,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [408272055] [2019-11-21 14:20:44,023 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 14:20:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:20:44,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 14:20:44,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:20:44,323 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 14:20:44,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:44,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:44,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:20:44,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 14:20:44,371 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 14:20:44,371 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:20:44,387 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 14:20:44,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [408272055] [2019-11-21 14:20:44,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:20:44,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-21 14:20:44,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525846224] [2019-11-21 14:20:44,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 14:20:44,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:20:44,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 14:20:44,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-21 14:20:44,417 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2019-11-21 14:20:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:20:44,843 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-11-21 14:20:44,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 14:20:44,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 14:20:44,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:20:44,855 INFO L225 Difference]: With dead ends: 99 [2019-11-21 14:20:44,856 INFO L226 Difference]: Without dead ends: 91 [2019-11-21 14:20:44,858 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 14:20:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-21 14:20:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2019-11-21 14:20:44,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-21 14:20:44,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-11-21 14:20:44,905 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 10 [2019-11-21 14:20:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:20:44,905 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-11-21 14:20:44,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 14:20:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-11-21 14:20:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 14:20:44,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:20:44,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:20:45,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:20:45,111 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 14:20:45,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:20:45,112 INFO L82 PathProgramCache]: Analyzing trace with hash -655644871, now seen corresponding path program 1 times [2019-11-21 14:20:45,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:20:45,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1981073925] [2019-11-21 14:20:45,114 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 14:20:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:20:45,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 14:20:45,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:20:45,309 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 14:20:45,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:45,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:45,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:20:45,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:20:45,351 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 14:20:45,352 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:20:45,457 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 14:20:45,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1981073925] [2019-11-21 14:20:45,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:20:45,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-21 14:20:45,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335652933] [2019-11-21 14:20:45,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 14:20:45,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:20:45,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 14:20:45,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 14:20:45,461 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 6 states. [2019-11-21 14:20:45,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:20:45,957 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-21 14:20:45,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 14:20:45,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-21 14:20:45,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:20:45,962 INFO L225 Difference]: With dead ends: 95 [2019-11-21 14:20:45,962 INFO L226 Difference]: Without dead ends: 95 [2019-11-21 14:20:45,963 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 14:20:45,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-21 14:20:45,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2019-11-21 14:20:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-21 14:20:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-11-21 14:20:45,973 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 10 [2019-11-21 14:20:45,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:20:45,974 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-11-21 14:20:45,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 14:20:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-11-21 14:20:45,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 14:20:45,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:20:45,975 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 14:20:46,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:20:46,177 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 14:20:46,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:20:46,178 INFO L82 PathProgramCache]: Analyzing trace with hash 952624162, now seen corresponding path program 1 times [2019-11-21 14:20:46,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:20:46,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1759598613] [2019-11-21 14:20:46,179 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 14:20:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:20:46,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 14:20:46,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:20:46,443 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 14:20:46,443 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:20:46,488 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 14:20:46,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1759598613] [2019-11-21 14:20:46,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:20:46,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 6 [2019-11-21 14:20:46,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012102691] [2019-11-21 14:20:46,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-21 14:20:46,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:20:46,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-21 14:20:46,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-21 14:20:46,492 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 7 states. [2019-11-21 14:20:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:20:46,881 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-11-21 14:20:46,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 14:20:46,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-21 14:20:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:20:46,885 INFO L225 Difference]: With dead ends: 91 [2019-11-21 14:20:46,885 INFO L226 Difference]: Without dead ends: 91 [2019-11-21 14:20:46,886 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 14:20:46,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-21 14:20:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2019-11-21 14:20:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-21 14:20:46,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2019-11-21 14:20:46,894 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 18 [2019-11-21 14:20:46,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:20:46,894 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2019-11-21 14:20:46,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-21 14:20:46,895 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2019-11-21 14:20:46,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 14:20:46,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:20:46,896 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 14:20:47,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:20:47,106 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 14:20:47,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:20:47,107 INFO L82 PathProgramCache]: Analyzing trace with hash -533376169, now seen corresponding path program 1 times [2019-11-21 14:20:47,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:20:47,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [79969683] [2019-11-21 14:20:47,108 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 14:20:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:20:47,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 14:20:47,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:20:47,319 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 14:20:47,319 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:20:47,331 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 14:20:47,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [79969683] [2019-11-21 14:20:47,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:20:47,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 14:20:47,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304930863] [2019-11-21 14:20:47,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 14:20:47,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:20:47,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 14:20:47,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 14:20:47,333 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 5 states. [2019-11-21 14:20:47,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:20:47,593 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-21 14:20:47,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 14:20:47,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-21 14:20:47,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:20:47,595 INFO L225 Difference]: With dead ends: 95 [2019-11-21 14:20:47,595 INFO L226 Difference]: Without dead ends: 95 [2019-11-21 14:20:47,595 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 14:20:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-21 14:20:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2019-11-21 14:20:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-21 14:20:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-11-21 14:20:47,604 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 19 [2019-11-21 14:20:47,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:20:47,604 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-11-21 14:20:47,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 14:20:47,605 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-11-21 14:20:47,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 14:20:47,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:20:47,606 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 14:20:47,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:20:47,808 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 14:20:47,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:20:47,808 INFO L82 PathProgramCache]: Analyzing trace with hash 439071551, now seen corresponding path program 1 times [2019-11-21 14:20:47,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:20:47,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1050895861] [2019-11-21 14:20:47,810 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 14:20:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:20:48,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-21 14:20:48,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:20:48,061 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 14:20:48,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:48,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:48,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:20:48,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-21 14:20:48,108 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 14:20:48,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:48,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:48,112 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 14:20:48,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-21 14:20:48,126 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 14:20:48,126 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:20:48,178 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 14:20:48,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-21 14:20:48,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:48,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-21 14:20:48,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-21 14:20:48,205 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 14:20:48,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1050895861] [2019-11-21 14:20:48,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:20:48,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-21 14:20:48,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991478544] [2019-11-21 14:20:48,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 14:20:48,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:20:48,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 14:20:48,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-21 14:20:48,207 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 11 states. [2019-11-21 14:20:49,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:20:49,091 INFO L93 Difference]: Finished difference Result 230 states and 246 transitions. [2019-11-21 14:20:49,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 14:20:49,092 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-21 14:20:49,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:20:49,094 INFO L225 Difference]: With dead ends: 230 [2019-11-21 14:20:49,094 INFO L226 Difference]: Without dead ends: 226 [2019-11-21 14:20:49,095 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 14:20:49,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-21 14:20:49,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 99. [2019-11-21 14:20:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-21 14:20:49,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2019-11-21 14:20:49,112 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 19 [2019-11-21 14:20:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:20:49,112 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2019-11-21 14:20:49,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 14:20:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2019-11-21 14:20:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 14:20:49,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:20:49,116 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 14:20:49,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:20:49,322 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 14:20:49,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:20:49,323 INFO L82 PathProgramCache]: Analyzing trace with hash 734896181, now seen corresponding path program 1 times [2019-11-21 14:20:49,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:20:49,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1295419944] [2019-11-21 14:20:49,323 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 14:20:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:20:49,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-21 14:20:49,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:20:49,478 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 14:20:49,479 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:20:49,494 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 14:20:49,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1295419944] [2019-11-21 14:20:49,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:20:49,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 14:20:49,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680812513] [2019-11-21 14:20:49,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 14:20:49,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:20:49,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 14:20:49,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 14:20:49,497 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand 4 states. [2019-11-21 14:20:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:20:49,514 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2019-11-21 14:20:49,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 14:20:49,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-21 14:20:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:20:49,516 INFO L225 Difference]: With dead ends: 145 [2019-11-21 14:20:49,517 INFO L226 Difference]: Without dead ends: 144 [2019-11-21 14:20:49,517 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 14:20:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-21 14:20:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 102. [2019-11-21 14:20:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-21 14:20:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2019-11-21 14:20:49,525 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 19 [2019-11-21 14:20:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:20:49,526 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2019-11-21 14:20:49,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 14:20:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2019-11-21 14:20:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 14:20:49,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:20:49,527 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 14:20:49,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:20:49,737 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 14:20:49,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:20:49,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1214032540, now seen corresponding path program 1 times [2019-11-21 14:20:49,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:20:49,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1695588016] [2019-11-21 14:20:49,739 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 14:20:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:20:49,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 14:20:49,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:20:49,975 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:49,976 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 14:20:49,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:50,003 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-21 14:20:50,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:20:50,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-21 14:20:50,025 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 14:20:50,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:50,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:50,039 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 14:20:50,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-11-21 14:20:50,064 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 14:20:50,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:50,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:50,071 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 14:20:50,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-11-21 14:20:50,097 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 14:20:50,097 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:20:50,130 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 14:20:50,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1695588016] [2019-11-21 14:20:50,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:20:50,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-21 14:20:50,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786302194] [2019-11-21 14:20:50,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 14:20:50,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:20:50,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 14:20:50,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-21 14:20:50,132 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand 8 states. [2019-11-21 14:20:50,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:20:50,674 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2019-11-21 14:20:50,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 14:20:50,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-21 14:20:50,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:20:50,677 INFO L225 Difference]: With dead ends: 115 [2019-11-21 14:20:50,677 INFO L226 Difference]: Without dead ends: 115 [2019-11-21 14:20:50,678 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 14:20:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-21 14:20:50,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2019-11-21 14:20:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-21 14:20:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2019-11-21 14:20:50,684 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 19 [2019-11-21 14:20:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:20:50,685 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2019-11-21 14:20:50,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 14:20:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2019-11-21 14:20:50,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 14:20:50,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:20:50,686 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 14:20:50,898 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:20:50,899 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 14:20:50,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:20:50,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1214032541, now seen corresponding path program 1 times [2019-11-21 14:20:50,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:20:50,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1959542323] [2019-11-21 14:20:50,901 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 14:20:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:20:51,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-21 14:20:51,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:20:51,101 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 14:20:51,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:51,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:51,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:20:51,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:20:51,134 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 14:20:51,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:51,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:51,157 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 14:20:51,157 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:51,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:51,176 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 14:20:51,176 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2019-11-21 14:20:51,206 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 14:20:51,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:51,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:51,230 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 14:20:51,230 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:51,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:51,237 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 14:20:51,237 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:11 [2019-11-21 14:20:51,274 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 14:20:51,274 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:20:51,485 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 14:20:51,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1959542323] [2019-11-21 14:20:51,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:20:51,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 14:20:51,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653547903] [2019-11-21 14:20:51,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 14:20:51,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:20:51,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 14:20:51,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-21 14:20:51,488 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 10 states. [2019-11-21 14:20:52,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:20:52,666 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-11-21 14:20:52,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 14:20:52,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-21 14:20:52,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:20:52,669 INFO L225 Difference]: With dead ends: 125 [2019-11-21 14:20:52,669 INFO L226 Difference]: Without dead ends: 125 [2019-11-21 14:20:52,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-21 14:20:52,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-21 14:20:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 93. [2019-11-21 14:20:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-21 14:20:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-11-21 14:20:52,683 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 19 [2019-11-21 14:20:52,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:20:52,683 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-11-21 14:20:52,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 14:20:52,684 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-11-21 14:20:52,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 14:20:52,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:20:52,684 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 14:20:52,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:20:52,895 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 14:20:52,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:20:52,896 INFO L82 PathProgramCache]: Analyzing trace with hash 643791046, now seen corresponding path program 1 times [2019-11-21 14:20:52,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:20:52,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [366500352] [2019-11-21 14:20:52,896 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 14:20:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:20:53,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 14:20:53,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:20:53,124 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 14:20:53,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:20:53,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:20:53,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:20:53,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 14:20:53,181 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 14:20:53,181 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:20:59,369 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 14:20:59,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [366500352] [2019-11-21 14:20:59,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:20:59,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 14:20:59,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751432635] [2019-11-21 14:20:59,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 14:20:59,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:20:59,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 14:20:59,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=64, Unknown=3, NotChecked=0, Total=90 [2019-11-21 14:20:59,372 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 10 states. [2019-11-21 14:20:59,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:20:59,899 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2019-11-21 14:20:59,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 14:20:59,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-21 14:20:59,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:20:59,901 INFO L225 Difference]: With dead ends: 111 [2019-11-21 14:20:59,901 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 14:20:59,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=44, Invalid=109, Unknown=3, NotChecked=0, Total=156 [2019-11-21 14:20:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 14:20:59,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2019-11-21 14:20:59,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-21 14:20:59,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2019-11-21 14:20:59,906 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 20 [2019-11-21 14:20:59,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:20:59,907 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2019-11-21 14:20:59,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 14:20:59,907 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2019-11-21 14:20:59,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 14:20:59,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:20:59,908 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 14:21:00,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:21:00,111 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 14:21:00,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:21:00,111 INFO L82 PathProgramCache]: Analyzing trace with hash 645208103, now seen corresponding path program 1 times [2019-11-21 14:21:00,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:21:00,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [417245224] [2019-11-21 14:21:00,112 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 14:21:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:21:00,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 14:21:00,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:21:00,340 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 14:21:00,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:21:00,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:00,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:21:00,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-21 14:21:00,432 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 14:21:00,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:21:00,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:00,438 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 14:21:00,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-21 14:21:00,466 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 14:21:00,466 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:21:00,564 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:00,564 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 14:21:00,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:00,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:00,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:00,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:21:00,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:21:00,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:21:00,649 INFO L567 ElimStorePlain]: treesize reduction 43, result has 25.9 percent of original size [2019-11-21 14:21:00,651 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 14:21:00,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2019-11-21 14:21:00,678 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 14:21:00,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [417245224] [2019-11-21 14:21:00,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:21:00,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-21 14:21:00,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761411257] [2019-11-21 14:21:00,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 14:21:00,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:21:00,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 14:21:00,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-21 14:21:00,680 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 13 states. [2019-11-21 14:21:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:21:01,306 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2019-11-21 14:21:01,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 14:21:01,307 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-11-21 14:21:01,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:21:01,308 INFO L225 Difference]: With dead ends: 112 [2019-11-21 14:21:01,308 INFO L226 Difference]: Without dead ends: 105 [2019-11-21 14:21:01,309 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 14:21:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-21 14:21:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2019-11-21 14:21:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-21 14:21:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-11-21 14:21:01,314 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 20 [2019-11-21 14:21:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:21:01,314 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-11-21 14:21:01,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 14:21:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-11-21 14:21:01,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-21 14:21:01,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:21:01,315 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 14:21:01,518 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:21:01,518 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 14:21:01,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:21:01,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1812033750, now seen corresponding path program 1 times [2019-11-21 14:21:01,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:21:01,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1563461187] [2019-11-21 14:21:01,520 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 14:21:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:21:01,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-21 14:21:01,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:21:01,762 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 14:21:01,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:21:01,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:01,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:21:01,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:21:01,796 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 14:21:01,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:21:01,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:01,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:21:01,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-21 14:21:01,845 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:01,846 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 14:21:01,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:21:01,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:01,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:21:01,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-21 14:21:01,888 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_23|], 2=[|v_#memory_int_25|]} [2019-11-21 14:21:01,896 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 14:21:01,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:21:01,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:01,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 14:21:01,937 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 14:21:01,938 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:21:01,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:01,958 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 14:21:01,958 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-11-21 14:21:01,994 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 14:21:01,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:21:02,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:02,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:21:02,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-21 14:21:02,086 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 14:21:02,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:21:02,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:02,099 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 14:21:02,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2019-11-21 14:21:02,195 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 14:21:02,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:21:02,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:02,203 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 14:21:02,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:9 [2019-11-21 14:21:02,227 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 14:21:02,228 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:21:02,481 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 14:21:02,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:02,488 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 14:21:02,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:36 [2019-11-21 14:21:06,725 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 14:21:06,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-21 14:21:06,949 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2019-11-21 14:21:06,950 INFO L567 ElimStorePlain]: treesize reduction 217, result has 15.6 percent of original size [2019-11-21 14:21:06,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:06,951 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 14:21:06,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:21 [2019-11-21 14:21:07,204 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 14:21:07,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1563461187] [2019-11-21 14:21:07,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 14:21:07,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-21 14:21:07,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96225640] [2019-11-21 14:21:07,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-21 14:21:07,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:21:07,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-21 14:21:07,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=387, Unknown=2, NotChecked=0, Total=462 [2019-11-21 14:21:07,207 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 22 states. [2019-11-21 14:21:10,653 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-11-21 14:21:10,868 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-11-21 14:21:11,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:21:11,997 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-11-21 14:21:11,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-21 14:21:11,998 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2019-11-21 14:21:11,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:21:12,002 INFO L225 Difference]: With dead ends: 101 [2019-11-21 14:21:12,002 INFO L226 Difference]: Without dead ends: 97 [2019-11-21 14:21:12,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=259, Invalid=999, Unknown=2, NotChecked=0, Total=1260 [2019-11-21 14:21:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-21 14:21:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2019-11-21 14:21:12,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-21 14:21:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2019-11-21 14:21:12,010 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 29 [2019-11-21 14:21:12,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:21:12,012 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2019-11-21 14:21:12,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-21 14:21:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2019-11-21 14:21:12,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-21 14:21:12,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:21:12,016 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 14:21:12,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:21:12,218 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 14:21:12,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:21:12,218 INFO L82 PathProgramCache]: Analyzing trace with hash -306007361, now seen corresponding path program 1 times [2019-11-21 14:21:12,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:21:12,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1445757935] [2019-11-21 14:21:12,220 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 14:21:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:21:12,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-21 14:21:12,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:21:12,421 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 14:21:12,422 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:21:12,432 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 14:21:12,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1445757935] [2019-11-21 14:21:12,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:21:12,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-21 14:21:12,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54428983] [2019-11-21 14:21:12,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 14:21:12,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:21:12,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 14:21:12,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 14:21:12,435 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 3 states. [2019-11-21 14:21:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:21:12,460 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2019-11-21 14:21:12,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 14:21:12,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-21 14:21:12,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:21:12,462 INFO L225 Difference]: With dead ends: 122 [2019-11-21 14:21:12,462 INFO L226 Difference]: Without dead ends: 122 [2019-11-21 14:21:12,463 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 14:21:12,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-21 14:21:12,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2019-11-21 14:21:12,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-21 14:21:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2019-11-21 14:21:12,468 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 37 [2019-11-21 14:21:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:21:12,468 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2019-11-21 14:21:12,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 14:21:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2019-11-21 14:21:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-21 14:21:12,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:21:12,473 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 14:21:12,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:21:12,676 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 14:21:12,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:21:12,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1059552773, now seen corresponding path program 1 times [2019-11-21 14:21:12,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:21:12,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1892926794] [2019-11-21 14:21:12,677 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 14:21:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:21:12,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-21 14:21:12,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:21:12,967 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 14:21:12,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:21:12,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:12,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:21:12,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:21:13,014 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:13,015 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 14:21:13,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:21:13,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:13,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:21:13,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-21 14:21:13,052 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 14:21:13,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:21:13,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:13,071 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 14:21:13,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-21 14:21:21,303 WARN L192 SmtUtils]: Spent 8.13 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-21 14:21:21,303 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:21,304 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 14:21:21,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:21:21,358 INFO L567 ElimStorePlain]: treesize reduction 34, result has 39.3 percent of original size [2019-11-21 14:21:21,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:21:21,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2019-11-21 14:21:21,389 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:21,389 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 14:21:21,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:21:21,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:21,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:21:21,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2019-11-21 14:21:21,473 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:21,473 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 14:21:21,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:21:21,526 INFO L567 ElimStorePlain]: treesize reduction 34, result has 46.9 percent of original size [2019-11-21 14:21:21,527 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 14:21:21,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2019-11-21 14:21:21,818 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 14:21:21,818 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:21:21,818 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 14:21:21,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:21:21,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:21:21,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:21:21,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:21:21,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:21:21,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:21:21,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 15 xjuncts. [2019-11-21 14:22:21,529 WARN L192 SmtUtils]: Spent 59.68 s on a formula simplification. DAG size of input: 74 DAG size of output: 33 [2019-11-21 14:22:21,529 INFO L567 ElimStorePlain]: treesize reduction 2178, result has 6.9 percent of original size [2019-11-21 14:22:21,531 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 14:22:21,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:92, output treesize:125 [2019-11-21 14:22:21,645 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 14:22:21,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:22:21,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:22:21,651 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 14:22:21,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:5 [2019-11-21 14:22:21,706 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 14:22:21,706 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:22:21,802 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 14:22:21,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:22:21,807 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 14:22:21,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:19 [2019-11-21 14:22:22,168 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:22:22,169 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 14:22:22,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:22,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:22:22,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:22:22,180 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 14:22:22,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2019-11-21 14:22:27,358 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 14:22:27,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:22:27,379 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 14:22:27,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:50 [2019-11-21 14:22:39,567 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-21 14:22:50,303 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:22:50,304 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 14:22:50,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:22:50,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:22:50,324 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 14:22:50,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:86, output treesize:77 [2019-11-21 14:22:52,742 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 14:22:52,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:52,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:52,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:53,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:53,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:53,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-21 14:22:54,340 WARN L192 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 120 DAG size of output: 47 [2019-11-21 14:22:54,341 INFO L567 ElimStorePlain]: treesize reduction 52159, result has 0.2 percent of original size [2019-11-21 14:22:54,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:54,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:54,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:54,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:54,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:54,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:54,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:54,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:54,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:54,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:54,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:54,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:54,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:54,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:54,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:54,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:54,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:54,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:54,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:54,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:22:54,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:22:54,355 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 14:22:54,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:87, output treesize:15 [2019-11-21 14:22:54,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:23:02,869 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 14:23:02,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1892926794] [2019-11-21 14:23:02,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 14:23:02,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2019-11-21 14:23:02,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238268496] [2019-11-21 14:23:02,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-21 14:23:02,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:23:02,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-21 14:23:02,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=719, Unknown=10, NotChecked=0, Total=812 [2019-11-21 14:23:02,872 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 29 states. [2019-11-21 14:23:23,861 WARN L192 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-11-21 14:23:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:23:26,451 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2019-11-21 14:23:26,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-21 14:23:26,452 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-11-21 14:23:26,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:23:26,453 INFO L225 Difference]: With dead ends: 159 [2019-11-21 14:23:26,453 INFO L226 Difference]: Without dead ends: 159 [2019-11-21 14:23:26,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 47.6s TimeCoverageRelationStatistics Valid=316, Invalid=1929, Unknown=11, NotChecked=0, Total=2256 [2019-11-21 14:23:26,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-21 14:23:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 108. [2019-11-21 14:23:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-21 14:23:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-11-21 14:23:26,457 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 37 [2019-11-21 14:23:26,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:23:26,457 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-11-21 14:23:26,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-21 14:23:26,457 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2019-11-21 14:23:26,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-21 14:23:26,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:23:26,458 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 14:23:26,658 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:23:26,659 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 14:23:26,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:23:26,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1059552774, now seen corresponding path program 1 times [2019-11-21 14:23:26,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:23:26,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2032688082] [2019-11-21 14:23:26,660 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 14:23:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:23:26,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-21 14:23:26,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:23:26,918 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 14:23:26,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:23:26,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:26,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:23:26,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:23:26,946 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 14:23:26,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:23:26,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:26,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:23:26,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-21 14:23:26,984 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:26,984 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 14:23:26,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:23:26,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:26,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:23:26,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-21 14:23:27,017 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_40|], 2=[|v_#memory_int_40|]} [2019-11-21 14:23:27,022 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 14:23:27,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:23:27,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:27,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 14:23:27,053 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 14:23:27,053 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:23:27,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:27,069 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 14:23:27,070 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-11-21 14:23:27,097 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 14:23:27,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:23:27,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:27,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:23:27,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2019-11-21 14:23:27,165 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 14:23:27,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:23:27,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:27,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:23:27,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-21 14:23:27,231 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:27,232 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 14:23:27,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:23:27,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:27,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:23:27,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-11-21 14:23:27,295 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_41|], 6=[|v_#memory_int_42|]} [2019-11-21 14:23:27,300 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 14:23:27,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:23:27,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:27,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 14:23:27,342 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 14:23:27,342 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:23:27,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:27,366 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 14:23:27,367 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:34 [2019-11-21 14:23:27,421 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 14:23:27,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:23:27,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:27,454 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 14:23:27,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:28 [2019-11-21 14:23:27,580 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:27,580 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 14:23:27,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:23:27,643 INFO L567 ElimStorePlain]: treesize reduction 16, result has 72.9 percent of original size [2019-11-21 14:23:27,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:23:27,644 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 14:23:27,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:43 [2019-11-21 14:23:27,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:23:27,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:23:27,797 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 14:23:27,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:23:27,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:27,803 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 14:23:27,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-11-21 14:23:27,836 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 14:23:27,837 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:23:27,952 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 14:23:27,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:27,956 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 14:23:27,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:20 [2019-11-21 14:23:30,064 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-21 14:23:36,165 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-21 14:23:44,271 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-21 14:23:44,283 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:44,283 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 14:23:44,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:23:44,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:44,299 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 14:23:44,299 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:33 [2019-11-21 14:23:44,410 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 14:23:44,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:23:44,418 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 14:23:44,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:43 [2019-11-21 14:23:50,786 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 14:23:50,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-21 14:23:51,742 WARN L192 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 44 [2019-11-21 14:23:51,743 INFO L567 ElimStorePlain]: treesize reduction 2845, result has 2.3 percent of original size [2019-11-21 14:23:51,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:23:51,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:23:51,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:23:51,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:23:51,748 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 14:23:51,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-11-21 14:23:51,979 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 14:23:51,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2032688082] [2019-11-21 14:23:51,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 14:23:51,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2019-11-21 14:23:51,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672185061] [2019-11-21 14:23:51,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-21 14:23:51,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:23:51,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-21 14:23:51,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=677, Unknown=7, NotChecked=0, Total=812 [2019-11-21 14:23:51,981 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 29 states. [2019-11-21 14:23:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:23:54,476 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-21 14:23:54,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-21 14:23:54,477 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-11-21 14:23:54,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:23:54,478 INFO L225 Difference]: With dead ends: 60 [2019-11-21 14:23:54,478 INFO L226 Difference]: Without dead ends: 0 [2019-11-21 14:23:54,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=359, Invalid=1440, Unknown=7, NotChecked=0, Total=1806 [2019-11-21 14:23:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-21 14:23:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-21 14:23:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-21 14:23:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-21 14:23:54,480 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-21 14:23:54,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:23:54,480 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-21 14:23:54,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-21 14:23:54,480 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-21 14:23:54,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-21 14:23:54,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:23:54,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 02:23:54 BoogieIcfgContainer [2019-11-21 14:23:54,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-21 14:23:54,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-21 14:23:54,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-21 14:23:54,687 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-21 14:23:54,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:20:43" (3/4) ... [2019-11-21 14:23:54,690 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-21 14:23:54,695 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-21 14:23:54,695 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-21 14:23:54,696 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-21 14:23:54,696 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-21 14:23:54,696 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-21 14:23:54,696 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-21 14:23:54,696 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-21 14:23:54,696 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-21 14:23:54,702 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-21 14:23:54,702 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-21 14:23:54,702 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-21 14:23:54,703 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-21 14:23:54,757 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-21 14:23:54,757 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-21 14:23:54,758 INFO L168 Benchmark]: Toolchain (without parser) took 192479.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 242.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -142.6 MB). Peak memory consumption was 99.7 MB. Max. memory is 11.5 GB. [2019-11-21 14:23:54,759 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 14:23:54,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 638.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -136.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-21 14:23:54,759 INFO L168 Benchmark]: Boogie Preprocessor took 84.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-21 14:23:54,760 INFO L168 Benchmark]: RCFGBuilder took 869.65 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 14:23:54,760 INFO L168 Benchmark]: TraceAbstraction took 190811.77 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 130.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -80.0 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. [2019-11-21 14:23:54,760 INFO L168 Benchmark]: Witness Printer took 70.39 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 14:23:54,763 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 638.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -136.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 869.65 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 190811.77 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 130.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -80.0 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. * Witness Printer took 70.39 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: 190.7s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 36.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 631 SDtfs, 2257 SDslu, 2339 SDs, 0 SdLazy, 3017 SolverSat, 425 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 23.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 691 GetRequests, 469 SyntacticMatches, 12 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 86.5s 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, 367 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 148.3s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 598 ConstructedInterpolants, 62 QuantifiedInterpolants, 153791 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...