./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/alternating_list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 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-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c54128245d3ab9ad313da188c7be33f66027c6a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-264dba8 [2019-11-21 14:45:54,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 14:45:54,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 14:45:54,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 14:45:54,729 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 14:45:54,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 14:45:54,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 14:45:54,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 14:45:54,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 14:45:54,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 14:45:54,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 14:45:54,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 14:45:54,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 14:45:54,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 14:45:54,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 14:45:54,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 14:45:54,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 14:45:54,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 14:45:54,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 14:45:54,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 14:45:54,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 14:45:54,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 14:45:54,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 14:45:54,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 14:45:54,787 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 14:45:54,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 14:45:54,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 14:45:54,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 14:45:54,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 14:45:54,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 14:45:54,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 14:45:54,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 14:45:54,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 14:45:54,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 14:45:54,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 14:45:54,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 14:45:54,796 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 14:45:54,796 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 14:45:54,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 14:45:54,797 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 14:45:54,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 14:45:54,799 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2019-11-21 14:45:54,836 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 14:45:54,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 14:45:54,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 14:45:54,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 14:45:54,840 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 14:45:54,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 14:45:54,841 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 14:45:54,841 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 14:45:54,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 14:45:54,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 14:45:54,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 14:45:54,846 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 14:45:54,846 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 14:45:54,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 14:45:54,847 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 14:45:54,847 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 14:45:54,847 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 14:45:54,848 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 14:45:54,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 14:45:54,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 14:45:54,849 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 14:45:54,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 14:45:54,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 14:45:54,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 14:45:54,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 14:45:54,850 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 14:45:54,850 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 14:45:54,850 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 14:45:54,850 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c54128245d3ab9ad313da188c7be33f66027c6a [2019-11-21 14:45:55,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 14:45:55,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 14:45:55,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 14:45:55,164 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 14:45:55,164 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 14:45:55,165 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:45:55,236 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49898c310/480b25ca7b2d44ef93141614491eb37e/FLAG20a1a02f7 [2019-11-21 14:45:55,769 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 14:45:55,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-21 14:45:55,782 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49898c310/480b25ca7b2d44ef93141614491eb37e/FLAG20a1a02f7 [2019-11-21 14:45:56,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49898c310/480b25ca7b2d44ef93141614491eb37e [2019-11-21 14:45:56,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 14:45:56,074 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 14:45:56,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 14:45:56,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 14:45:56,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 14:45:56,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:45:56" (1/1) ... [2019-11-21 14:45:56,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70d85277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:45:56, skipping insertion in model container [2019-11-21 14:45:56,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:45:56" (1/1) ... [2019-11-21 14:45:56,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 14:45:56,151 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 14:45:56,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 14:45:56,604 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 14:45:56,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 14:45:56,768 INFO L205 MainTranslator]: Completed translation [2019-11-21 14:45:56,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:45:56 WrapperNode [2019-11-21 14:45:56,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 14:45:56,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 14:45:56,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 14:45:56,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 14:45:56,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:45:56" (1/1) ... [2019-11-21 14:45:56,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:45:56" (1/1) ... [2019-11-21 14:45:56,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:45:56" (1/1) ... [2019-11-21 14:45:56,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:45:56" (1/1) ... [2019-11-21 14:45:56,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:45:56" (1/1) ... [2019-11-21 14:45:56,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:45:56" (1/1) ... [2019-11-21 14:45:56,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:45:56" (1/1) ... [2019-11-21 14:45:56,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 14:45:56,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 14:45:56,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 14:45:56,881 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 14:45:56,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:45:56" (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:45:56,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 14:45:56,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 14:45:56,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 14:45:56,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 14:45:56,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-21 14:45:56,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-21 14:45:56,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-21 14:45:56,944 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-21 14:45:56,945 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 14:45:56,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 14:45:56,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 14:45:56,945 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 14:45:56,945 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 14:45:56,946 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 14:45:56,946 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 14:45:56,946 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 14:45:56,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 14:45:56,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 14:45:56,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 14:45:56,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 14:45:56,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 14:45:56,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 14:45:56,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 14:45:56,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 14:45:56,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 14:45:56,947 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 14:45:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 14:45:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 14:45:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 14:45:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-21 14:45:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-21 14:45:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-21 14:45:56,949 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 14:45:56,951 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 14:45:56,951 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 14:45:56,951 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 14:45:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 14:45:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 14:45:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 14:45:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 14:45:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 14:45:56,953 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 14:45:56,953 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 14:45:56,953 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 14:45:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 14:45:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 14:45:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 14:45:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 14:45:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 14:45:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 14:45:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 14:45:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 14:45:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 14:45:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 14:45:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 14:45:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 14:45:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 14:45:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 14:45:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 14:45:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 14:45:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 14:45:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 14:45:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 14:45:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 14:45:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 14:45:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 14:45:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 14:45:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 14:45:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 14:45:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 14:45:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 14:45:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 14:45:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 14:45:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 14:45:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 14:45:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 14:45:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 14:45:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 14:45:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 14:45:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 14:45:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 14:45:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 14:45:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 14:45:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 14:45:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 14:45:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 14:45:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 14:45:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 14:45:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 14:45:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 14:45:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 14:45:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 14:45:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 14:45:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 14:45:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 14:45:56,970 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 14:45:56,970 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 14:45:56,970 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 14:45:56,970 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 14:45:56,970 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 14:45:56,970 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 14:45:56,970 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 14:45:56,970 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 14:45:56,970 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 14:45:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 14:45:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 14:45:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 14:45:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 14:45:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 14:45:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 14:45:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 14:45:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 14:45:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 14:45:56,972 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 14:45:56,972 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 14:45:56,972 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 14:45:56,972 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 14:45:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 14:45:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-21 14:45:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 14:45:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 14:45:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 14:45:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 14:45:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 14:45:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 14:45:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 14:45:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 14:45:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 14:45:57,340 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-21 14:45:57,761 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 14:45:57,761 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-21 14:45:57,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:45:57 BoogieIcfgContainer [2019-11-21 14:45:57,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 14:45:57,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 14:45:57,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 14:45:57,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 14:45:57,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 02:45:56" (1/3) ... [2019-11-21 14:45:57,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71237eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:45:57, skipping insertion in model container [2019-11-21 14:45:57,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:45:56" (2/3) ... [2019-11-21 14:45:57,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71237eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:45:57, skipping insertion in model container [2019-11-21 14:45:57,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:45:57" (3/3) ... [2019-11-21 14:45:57,771 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2019-11-21 14:45:57,781 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 14:45:57,790 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-21 14:45:57,802 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-21 14:45:57,823 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 14:45:57,824 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 14:45:57,824 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 14:45:57,824 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 14:45:57,824 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 14:45:57,825 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 14:45:57,825 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 14:45:57,825 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 14:45:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2019-11-21 14:45:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 14:45:57,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:45:57,855 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:45:57,856 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:45:57,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:45:57,863 INFO L82 PathProgramCache]: Analyzing trace with hash -655644872, now seen corresponding path program 1 times [2019-11-21 14:45:57,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:45:57,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2040409275] [2019-11-21 14:45:57,876 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:45:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:45:58,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 14:45:58,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:45:58,172 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:45:58,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:45:58,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:45:58,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:45:58,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 14:45:58,211 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:45:58,211 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:45:58,227 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:45:58,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2040409275] [2019-11-21 14:45:58,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:45:58,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-21 14:45:58,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034924680] [2019-11-21 14:45:58,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 14:45:58,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:45:58,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 14:45:58,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-21 14:45:58,257 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2019-11-21 14:45:58,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:45:58,653 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-11-21 14:45:58,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 14:45:58,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 14:45:58,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:45:58,666 INFO L225 Difference]: With dead ends: 99 [2019-11-21 14:45:58,666 INFO L226 Difference]: Without dead ends: 91 [2019-11-21 14:45:58,668 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:45:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-21 14:45:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2019-11-21 14:45:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-21 14:45:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-11-21 14:45:58,750 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 10 [2019-11-21 14:45:58,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:45:58,751 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-11-21 14:45:58,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 14:45:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-11-21 14:45:58,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 14:45:58,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:45:58,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 14:45:58,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:45:58,958 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:45:58,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:45:58,959 INFO L82 PathProgramCache]: Analyzing trace with hash -655644871, now seen corresponding path program 1 times [2019-11-21 14:45:58,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:45:58,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [394708456] [2019-11-21 14:45:58,961 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:45:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:45:59,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 14:45:59,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:45:59,162 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:45:59,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:45:59,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:45:59,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:45:59,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:45:59,211 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:45:59,212 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:45:59,322 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:45:59,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [394708456] [2019-11-21 14:45:59,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:45:59,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-21 14:45:59,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878701158] [2019-11-21 14:45:59,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 14:45:59,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:45:59,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 14:45:59,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 14:45:59,326 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 6 states. [2019-11-21 14:45:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:45:59,789 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-21 14:45:59,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 14:45:59,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-21 14:45:59,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:45:59,795 INFO L225 Difference]: With dead ends: 95 [2019-11-21 14:45:59,795 INFO L226 Difference]: Without dead ends: 95 [2019-11-21 14:45:59,797 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:45:59,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-21 14:45:59,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2019-11-21 14:45:59,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-21 14:45:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-11-21 14:45:59,813 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 10 [2019-11-21 14:45:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:45:59,815 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-11-21 14:45:59,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 14:45:59,816 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-11-21 14:45:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 14:45:59,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:45:59,817 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:46:00,020 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:46:00,021 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:46:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:46:00,023 INFO L82 PathProgramCache]: Analyzing trace with hash 952624162, now seen corresponding path program 1 times [2019-11-21 14:46:00,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:46:00,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [482433634] [2019-11-21 14:46:00,028 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:46:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:46:00,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 14:46:00,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:46:00,273 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:46:00,274 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:46:00,310 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:46:00,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [482433634] [2019-11-21 14:46:00,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:46:00,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 6 [2019-11-21 14:46:00,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746425099] [2019-11-21 14:46:00,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-21 14:46:00,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:46:00,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-21 14:46:00,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-21 14:46:00,313 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 7 states. [2019-11-21 14:46:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:46:00,698 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-11-21 14:46:00,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 14:46:00,698 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-21 14:46:00,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:46:00,700 INFO L225 Difference]: With dead ends: 91 [2019-11-21 14:46:00,700 INFO L226 Difference]: Without dead ends: 91 [2019-11-21 14:46:00,701 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:46:00,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-21 14:46:00,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2019-11-21 14:46:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-21 14:46:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2019-11-21 14:46:00,709 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 18 [2019-11-21 14:46:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:46:00,709 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2019-11-21 14:46:00,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-21 14:46:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2019-11-21 14:46:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 14:46:00,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:46:00,710 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:46:00,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:46:00,914 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:46:00,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:46:00,915 INFO L82 PathProgramCache]: Analyzing trace with hash -533376169, now seen corresponding path program 1 times [2019-11-21 14:46:00,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:46:00,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1020673476] [2019-11-21 14:46:00,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 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:46:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:46:01,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 14:46:01,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:46:01,112 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:46:01,112 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:46:01,120 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:46:01,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1020673476] [2019-11-21 14:46:01,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:46:01,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 14:46:01,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664291663] [2019-11-21 14:46:01,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 14:46:01,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:46:01,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 14:46:01,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 14:46:01,122 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 5 states. [2019-11-21 14:46:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:46:01,351 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-21 14:46:01,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 14:46:01,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-21 14:46:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:46:01,353 INFO L225 Difference]: With dead ends: 95 [2019-11-21 14:46:01,354 INFO L226 Difference]: Without dead ends: 95 [2019-11-21 14:46:01,354 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:46:01,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-21 14:46:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2019-11-21 14:46:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-21 14:46:01,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-11-21 14:46:01,364 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 19 [2019-11-21 14:46:01,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:46:01,364 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-11-21 14:46:01,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 14:46:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-11-21 14:46:01,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 14:46:01,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:46:01,366 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:46:01,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:46:01,570 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:46:01,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:46:01,572 INFO L82 PathProgramCache]: Analyzing trace with hash 439071551, now seen corresponding path program 1 times [2019-11-21 14:46:01,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:46:01,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [230033155] [2019-11-21 14:46:01,573 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:46:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:46:01,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-21 14:46:01,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:46:01,824 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:46:01,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:01,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:01,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:46:01,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-21 14:46:01,876 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:46:01,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:01,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:01,880 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:46:01,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-21 14:46:01,894 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:46:01,894 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:46:01,946 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:46:01,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-21 14:46:01,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:01,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-21 14:46:01,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-21 14:46:01,981 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:46:01,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [230033155] [2019-11-21 14:46:01,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:46:01,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-21 14:46:01,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874642400] [2019-11-21 14:46:01,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 14:46:01,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:46:01,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 14:46:01,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-21 14:46:01,983 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 11 states. [2019-11-21 14:46:02,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:46:02,901 INFO L93 Difference]: Finished difference Result 230 states and 246 transitions. [2019-11-21 14:46:02,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 14:46:02,901 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-21 14:46:02,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:46:02,904 INFO L225 Difference]: With dead ends: 230 [2019-11-21 14:46:02,904 INFO L226 Difference]: Without dead ends: 226 [2019-11-21 14:46:02,905 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:46:02,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-21 14:46:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 99. [2019-11-21 14:46:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-21 14:46:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2019-11-21 14:46:02,925 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 19 [2019-11-21 14:46:02,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:46:02,926 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2019-11-21 14:46:02,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 14:46:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2019-11-21 14:46:02,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 14:46:02,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:46:02,927 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:46:03,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:46:03,128 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:46:03,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:46:03,129 INFO L82 PathProgramCache]: Analyzing trace with hash 734896181, now seen corresponding path program 1 times [2019-11-21 14:46:03,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:46:03,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1469159449] [2019-11-21 14:46:03,130 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:46:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:46:03,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-21 14:46:03,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:46:03,281 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:46:03,282 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:46:03,293 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:46:03,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1469159449] [2019-11-21 14:46:03,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:46:03,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 14:46:03,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550199602] [2019-11-21 14:46:03,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 14:46:03,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:46:03,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 14:46:03,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 14:46:03,296 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand 4 states. [2019-11-21 14:46:03,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:46:03,318 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2019-11-21 14:46:03,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 14:46:03,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-21 14:46:03,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:46:03,320 INFO L225 Difference]: With dead ends: 145 [2019-11-21 14:46:03,320 INFO L226 Difference]: Without dead ends: 144 [2019-11-21 14:46:03,320 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:46:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-21 14:46:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 102. [2019-11-21 14:46:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-21 14:46:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2019-11-21 14:46:03,336 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 19 [2019-11-21 14:46:03,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:46:03,337 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2019-11-21 14:46:03,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 14:46:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2019-11-21 14:46:03,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 14:46:03,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:46:03,341 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:46:03,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:46:03,542 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:46:03,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:46:03,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1214032540, now seen corresponding path program 1 times [2019-11-21 14:46:03,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:46:03,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [562331720] [2019-11-21 14:46:03,544 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:46:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:46:03,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 14:46:03,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:46:03,779 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:03,780 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:46:03,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:03,815 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-21 14:46:03,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:46:03,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-21 14:46:03,846 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:46:03,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:03,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:03,861 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:46:03,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-11-21 14:46:03,894 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:46:03,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:03,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:03,904 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:46:03,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-11-21 14:46:03,938 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:46:03,938 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:46:03,976 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:46:03,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [562331720] [2019-11-21 14:46:03,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:46:03,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-21 14:46:03,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859025858] [2019-11-21 14:46:03,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 14:46:03,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:46:03,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 14:46:03,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-21 14:46:03,979 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand 8 states. [2019-11-21 14:46:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:46:04,527 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2019-11-21 14:46:04,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 14:46:04,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-21 14:46:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:46:04,531 INFO L225 Difference]: With dead ends: 115 [2019-11-21 14:46:04,531 INFO L226 Difference]: Without dead ends: 115 [2019-11-21 14:46:04,532 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:46:04,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-21 14:46:04,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2019-11-21 14:46:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-21 14:46:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2019-11-21 14:46:04,538 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 19 [2019-11-21 14:46:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:46:04,539 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2019-11-21 14:46:04,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 14:46:04,539 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2019-11-21 14:46:04,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 14:46:04,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:46:04,540 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:46:04,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:46:04,742 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:46:04,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:46:04,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1214032541, now seen corresponding path program 1 times [2019-11-21 14:46:04,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:46:04,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [730617623] [2019-11-21 14:46:04,744 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:46:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:46:04,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-21 14:46:04,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:46:04,941 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:46:04,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:04,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:04,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:46:04,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:46:04,978 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:46:04,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:04,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:04,997 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:46:04,997 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:05,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:05,008 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:46:05,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-21 14:46:05,042 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-21 14:46:05,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:05,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:05,057 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:46:05,057 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:05,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:05,072 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:46:05,072 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-11-21 14:46:05,105 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:46:05,105 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:46:05,290 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:46:05,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [730617623] [2019-11-21 14:46:05,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:46:05,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 14:46:05,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474946780] [2019-11-21 14:46:05,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 14:46:05,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:46:05,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 14:46:05,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-21 14:46:05,293 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 10 states. [2019-11-21 14:46:06,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:46:06,449 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-11-21 14:46:06,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 14:46:06,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-21 14:46:06,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:46:06,452 INFO L225 Difference]: With dead ends: 125 [2019-11-21 14:46:06,452 INFO L226 Difference]: Without dead ends: 125 [2019-11-21 14:46:06,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-21 14:46:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-21 14:46:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 93. [2019-11-21 14:46:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-21 14:46:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-11-21 14:46:06,459 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 19 [2019-11-21 14:46:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:46:06,460 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-11-21 14:46:06,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 14:46:06,460 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-11-21 14:46:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 14:46:06,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:46:06,462 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:46:06,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:46:06,663 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:46:06,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:46:06,663 INFO L82 PathProgramCache]: Analyzing trace with hash 643791046, now seen corresponding path program 1 times [2019-11-21 14:46:06,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:46:06,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [428125719] [2019-11-21 14:46:06,664 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:46:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:46:06,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 14:46:06,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:46:06,895 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:46:06,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:06,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:06,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:46:06,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 14:46:06,961 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:46:06,961 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:46:11,082 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:46:11,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [428125719] [2019-11-21 14:46:11,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:46:11,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 14:46:11,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110190268] [2019-11-21 14:46:11,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 14:46:11,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:46:11,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 14:46:11,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=65, Unknown=2, NotChecked=0, Total=90 [2019-11-21 14:46:11,084 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 10 states. [2019-11-21 14:46:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:46:11,614 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2019-11-21 14:46:11,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 14:46:11,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-21 14:46:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:46:11,616 INFO L225 Difference]: With dead ends: 111 [2019-11-21 14:46:11,616 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 14:46:11,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=44, Invalid=110, Unknown=2, NotChecked=0, Total=156 [2019-11-21 14:46:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 14:46:11,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2019-11-21 14:46:11,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-21 14:46:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2019-11-21 14:46:11,622 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 20 [2019-11-21 14:46:11,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:46:11,622 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2019-11-21 14:46:11,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 14:46:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2019-11-21 14:46:11,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 14:46:11,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:46:11,623 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:46:11,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:46:11,827 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:46:11,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:46:11,827 INFO L82 PathProgramCache]: Analyzing trace with hash 645208103, now seen corresponding path program 1 times [2019-11-21 14:46:11,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:46:11,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [934096784] [2019-11-21 14:46:11,828 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:46:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:46:12,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 14:46:12,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:46:12,042 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:46:12,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:12,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:12,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:46:12,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-21 14:46:12,123 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:46:12,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:12,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:12,128 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:46:12,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-21 14:46:12,144 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:46:12,144 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:46:12,248 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:12,249 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:46:12,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:12,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:12,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:12,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:46:12,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:46:12,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:12,327 INFO L567 ElimStorePlain]: treesize reduction 43, result has 25.9 percent of original size [2019-11-21 14:46:12,328 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:46:12,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2019-11-21 14:46:12,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:46:12,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [934096784] [2019-11-21 14:46:12,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:46:12,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-21 14:46:12,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629701564] [2019-11-21 14:46:12,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 14:46:12,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:46:12,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 14:46:12,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-21 14:46:12,354 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 13 states. [2019-11-21 14:46:14,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:46:14,949 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2019-11-21 14:46:14,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 14:46:14,950 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-11-21 14:46:14,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:46:14,952 INFO L225 Difference]: With dead ends: 112 [2019-11-21 14:46:14,952 INFO L226 Difference]: Without dead ends: 105 [2019-11-21 14:46:14,952 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:46:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-21 14:46:14,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2019-11-21 14:46:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-21 14:46:14,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-11-21 14:46:14,957 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 20 [2019-11-21 14:46:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:46:14,957 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-11-21 14:46:14,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 14:46:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-11-21 14:46:14,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-21 14:46:14,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:46:14,959 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:46:15,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:46:15,160 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:46:15,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:46:15,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1812033750, now seen corresponding path program 1 times [2019-11-21 14:46:15,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:46:15,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1341054256] [2019-11-21 14:46:15,162 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:46:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:46:15,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-21 14:46:15,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:46:15,403 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:46:15,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:15,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:15,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:46:15,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:46:15,438 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:46:15,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:15,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:15,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:46:15,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-21 14:46:15,482 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:15,482 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:46:15,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:15,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:15,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:46:15,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-21 14:46:15,522 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_23|], 2=[|v_#memory_int_25|]} [2019-11-21 14:46:15,528 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:46:15,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:15,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:15,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 14:46:15,571 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:46:15,572 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:15,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:15,588 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:46:15,589 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-11-21 14:46:15,634 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:46:15,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:15,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:15,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:46:15,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-21 14:46:15,715 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:46:15,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:15,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:15,739 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:46:15,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2019-11-21 14:46:15,841 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:46:15,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:15,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:15,853 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:46:15,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:9 [2019-11-21 14:46:15,877 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:46:15,878 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:46:16,117 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:46:16,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:16,123 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:46:16,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:36 [2019-11-21 14:46:18,369 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:46:18,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-21 14:46:18,586 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2019-11-21 14:46:18,587 INFO L567 ElimStorePlain]: treesize reduction 217, result has 15.6 percent of original size [2019-11-21 14:46:18,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:18,589 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:46:18,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:21 [2019-11-21 14:46:18,867 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:46:18,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1341054256] [2019-11-21 14:46:18,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 14:46:18,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-21 14:46:18,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695079195] [2019-11-21 14:46:18,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-21 14:46:18,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:46:18,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-21 14:46:18,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=388, Unknown=1, NotChecked=0, Total=462 [2019-11-21 14:46:18,870 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 22 states. [2019-11-21 14:46:20,242 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-11-21 14:46:20,456 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:46:21,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:46:21,574 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-11-21 14:46:21,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-21 14:46:21,575 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2019-11-21 14:46:21,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:46:21,576 INFO L225 Difference]: With dead ends: 101 [2019-11-21 14:46:21,576 INFO L226 Difference]: Without dead ends: 97 [2019-11-21 14:46:21,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=259, Invalid=1000, Unknown=1, NotChecked=0, Total=1260 [2019-11-21 14:46:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-21 14:46:21,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2019-11-21 14:46:21,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-21 14:46:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2019-11-21 14:46:21,580 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 29 [2019-11-21 14:46:21,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:46:21,581 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2019-11-21 14:46:21,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-21 14:46:21,581 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2019-11-21 14:46:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-21 14:46:21,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:46:21,583 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:46:21,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:46:21,784 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:46:21,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:46:21,784 INFO L82 PathProgramCache]: Analyzing trace with hash -306007361, now seen corresponding path program 1 times [2019-11-21 14:46:21,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:46:21,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [721703386] [2019-11-21 14:46:21,786 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:46:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:46:21,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-21 14:46:21,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:46:22,013 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:46:22,013 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:46:22,022 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:46:22,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [721703386] [2019-11-21 14:46:22,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 14:46:22,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-21 14:46:22,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826393312] [2019-11-21 14:46:22,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 14:46:22,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:46:22,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 14:46:22,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 14:46:22,024 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 3 states. [2019-11-21 14:46:22,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:46:22,044 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2019-11-21 14:46:22,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 14:46:22,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-21 14:46:22,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:46:22,047 INFO L225 Difference]: With dead ends: 122 [2019-11-21 14:46:22,047 INFO L226 Difference]: Without dead ends: 122 [2019-11-21 14:46:22,047 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:46:22,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-21 14:46:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2019-11-21 14:46:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-21 14:46:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2019-11-21 14:46:22,052 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 37 [2019-11-21 14:46:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:46:22,053 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2019-11-21 14:46:22,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 14:46:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2019-11-21 14:46:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-21 14:46:22,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:46:22,058 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:46:22,259 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:46:22,259 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:46:22,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:46:22,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1059552773, now seen corresponding path program 1 times [2019-11-21 14:46:22,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:46:22,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1500118818] [2019-11-21 14:46:22,263 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:46:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:46:22,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-21 14:46:22,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:46:22,556 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:46:22,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:22,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:22,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:46:22,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:46:22,609 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:22,609 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:46:22,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:22,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:22,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:46:22,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-21 14:46:22,642 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:46:22,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:22,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:22,660 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:46:22,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-21 14:46:30,891 WARN L192 SmtUtils]: Spent 8.14 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-21 14:46:30,891 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:30,891 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:46:30,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:30,929 INFO L567 ElimStorePlain]: treesize reduction 34, result has 39.3 percent of original size [2019-11-21 14:46:30,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:46:30,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2019-11-21 14:46:30,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:30,960 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:46:30,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:30,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:30,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:46:30,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2019-11-21 14:46:31,043 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:31,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 60 [2019-11-21 14:46:31,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:46:31,098 INFO L567 ElimStorePlain]: treesize reduction 34, result has 46.9 percent of original size [2019-11-21 14:46:31,099 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:46:31,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2019-11-21 14:46:31,370 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 14:46:31,371 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:46:31,371 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:46:31,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:46:31,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:46:31,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:46:31,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:46:31,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:46:31,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:46:31,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 15 xjuncts. [2019-11-21 14:47:30,910 WARN L192 SmtUtils]: Spent 59.51 s on a formula simplification. DAG size of input: 74 DAG size of output: 33 [2019-11-21 14:47:30,911 INFO L567 ElimStorePlain]: treesize reduction 2178, result has 6.9 percent of original size [2019-11-21 14:47:30,912 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:47:30,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:92, output treesize:125 [2019-11-21 14:47:31,029 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:47:31,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:47:31,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:47:31,035 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:47:31,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:5 [2019-11-21 14:47:31,089 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:47:31,089 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:47:31,184 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:47:31,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:47:31,188 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:47:31,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:19 [2019-11-21 14:47:33,196 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~p~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (= (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_main_~p~0.base (store (select |c_#memory_$Pointer$.base| c_main_~p~0.base) main_~p~0.offset v_DerPreprocessor_2)) c_main_~a~0.base) (bvadd c_main_~a~0.offset (_ bv4 32)))))) is different from false [2019-11-21 14:47:36,060 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:47:36,060 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:47:36,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:47:36,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:47:36,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:47:36,072 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:47:36,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2019-11-21 14:47:40,590 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:47:40,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:47:40,606 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:47:40,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:50 [2019-11-21 14:47:53,117 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-21 14:48:07,199 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-21 14:48:07,222 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:07,223 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:48:07,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:48:07,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:07,261 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:48:07,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:86, output treesize:77 [2019-11-21 14:48:07,823 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:48:07,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:07,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:07,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:08,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:08,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-21 14:48:09,489 WARN L192 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 120 DAG size of output: 47 [2019-11-21 14:48:09,489 INFO L567 ElimStorePlain]: treesize reduction 52159, result has 0.2 percent of original size [2019-11-21 14:48:09,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:09,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:09,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:09,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:09,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:09,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:09,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:09,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:09,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:09,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:09,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:09,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:09,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:09,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:09,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:09,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:09,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:09,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:09,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:09,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:09,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:09,507 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:48:09,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:87, output treesize:15 [2019-11-21 14:48:09,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 14:48:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-11-21 14:48:17,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1500118818] [2019-11-21 14:48:17,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 14:48:17,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2019-11-21 14:48:17,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809721095] [2019-11-21 14:48:17,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-21 14:48:17,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:48:17,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-21 14:48:17,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=668, Unknown=11, NotChecked=52, Total=812 [2019-11-21 14:48:17,952 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 29 states. [2019-11-21 14:48:21,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:48:21,141 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2019-11-21 14:48:21,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-21 14:48:21,142 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-11-21 14:48:21,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:48:21,143 INFO L225 Difference]: With dead ends: 153 [2019-11-21 14:48:21,143 INFO L226 Difference]: Without dead ends: 153 [2019-11-21 14:48:21,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 46.6s TimeCoverageRelationStatistics Valid=272, Invalid=1613, Unknown=11, NotChecked=84, Total=1980 [2019-11-21 14:48:21,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-21 14:48:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 108. [2019-11-21 14:48:21,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-21 14:48:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-11-21 14:48:21,148 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 37 [2019-11-21 14:48:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:48:21,149 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-11-21 14:48:21,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-21 14:48:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2019-11-21 14:48:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-21 14:48:21,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 14:48:21,150 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:48:21,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:48:21,351 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:48:21,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 14:48:21,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1059552774, now seen corresponding path program 1 times [2019-11-21 14:48:21,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 14:48:21,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [225015480] [2019-11-21 14:48:21,355 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:48:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 14:48:21,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-21 14:48:21,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 14:48:21,609 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:48:21,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:48:21,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:21,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:48:21,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 14:48:21,649 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:48:21,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:48:21,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:21,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:48:21,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-21 14:48:21,713 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:21,714 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:48:21,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:48:21,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:21,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:48:21,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-21 14:48:21,749 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_40|], 2=[|v_#memory_int_40|]} [2019-11-21 14:48:21,755 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:48:21,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:48:21,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:21,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 14:48:21,788 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:48:21,789 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:48:21,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:21,807 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:48:21,808 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-11-21 14:48:21,837 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:48:21,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:48:21,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:21,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:48:21,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2019-11-21 14:48:21,898 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:48:21,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:48:21,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:21,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:48:21,916 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-21 14:48:21,964 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:21,965 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:48:21,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:48:21,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:21,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 14:48:21,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-11-21 14:48:22,013 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_41|], 6=[|v_#memory_int_42|]} [2019-11-21 14:48:22,019 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:48:22,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:48:22,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:22,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 14:48:22,057 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:48:22,057 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 14:48:22,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:22,084 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:48:22,084 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:34 [2019-11-21 14:48:22,131 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:48:22,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:48:22,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:22,146 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:48:22,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:28 [2019-11-21 14:48:22,251 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:22,251 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:48:22,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:48:22,312 INFO L567 ElimStorePlain]: treesize reduction 16, result has 72.9 percent of original size [2019-11-21 14:48:22,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:22,315 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:48:22,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:43 [2019-11-21 14:48:22,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:22,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:22,500 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:48:22,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:48:22,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:22,506 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:48:22,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-11-21 14:48:22,558 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:48:22,558 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 14:48:22,705 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:48:22,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:22,711 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:48:22,711 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:20 [2019-11-21 14:48:24,818 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-21 14:48:30,951 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-21 14:48:37,056 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-21 14:48:37,072 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:37,072 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:48:37,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 14:48:37,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:37,087 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:48:37,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:33 [2019-11-21 14:48:37,196 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:48:37,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 14:48:37,209 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:48:37,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:43 [2019-11-21 14:48:43,662 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:48:43,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-21 14:48:44,747 WARN L192 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 117 DAG size of output: 44 [2019-11-21 14:48:44,748 INFO L567 ElimStorePlain]: treesize reduction 2845, result has 2.3 percent of original size [2019-11-21 14:48:44,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:44,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:44,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:44,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 14:48:44,752 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:48:44,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-11-21 14:48:44,983 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:48:44,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [225015480] [2019-11-21 14:48:44,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 14:48:44,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2019-11-21 14:48:44,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59364505] [2019-11-21 14:48:44,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-21 14:48:44,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 14:48:44,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-21 14:48:44,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=678, Unknown=6, NotChecked=0, Total=812 [2019-11-21 14:48:44,985 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 29 states. [2019-11-21 14:48:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 14:48:47,221 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-21 14:48:47,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-21 14:48:47,222 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-11-21 14:48:47,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 14:48:47,223 INFO L225 Difference]: With dead ends: 60 [2019-11-21 14:48:47,223 INFO L226 Difference]: Without dead ends: 0 [2019-11-21 14:48:47,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=359, Invalid=1441, Unknown=6, NotChecked=0, Total=1806 [2019-11-21 14:48:47,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-21 14:48:47,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-21 14:48:47,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-21 14:48:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-21 14:48:47,224 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-21 14:48:47,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 14:48:47,224 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-21 14:48:47,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-21 14:48:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-21 14:48:47,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-21 14:48:47,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 14:48:47,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 02:48:47 BoogieIcfgContainer [2019-11-21 14:48:47,431 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-21 14:48:47,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-21 14:48:47,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-21 14:48:47,432 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-21 14:48:47,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:45:57" (3/4) ... [2019-11-21 14:48:47,435 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-21 14:48:47,440 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-21 14:48:47,440 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-21 14:48:47,440 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-21 14:48:47,441 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-21 14:48:47,441 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-21 14:48:47,441 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-21 14:48:47,441 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-21 14:48:47,441 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-21 14:48:47,446 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-21 14:48:47,447 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-21 14:48:47,447 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-21 14:48:47,448 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-21 14:48:47,497 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-21 14:48:47,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-21 14:48:47,498 INFO L168 Benchmark]: Toolchain (without parser) took 171425.03 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 259.0 MB). Free memory was 960.4 MB in the beginning and 1.0 GB in the end (delta: -56.9 MB). Peak memory consumption was 202.0 MB. Max. memory is 11.5 GB. [2019-11-21 14:48:47,499 INFO L168 Benchmark]: CDTParser took 0.20 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:48:47,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-21 14:48:47,502 INFO L168 Benchmark]: Boogie Preprocessor took 109.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 14:48:47,502 INFO L168 Benchmark]: RCFGBuilder took 882.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. [2019-11-21 14:48:47,502 INFO L168 Benchmark]: TraceAbstraction took 169667.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.0 MB). Peak memory consumption was 150.7 MB. Max. memory is 11.5 GB. [2019-11-21 14:48:47,503 INFO L168 Benchmark]: Witness Printer took 65.48 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-11-21 14:48:47,505 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.20 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 695.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 109.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 882.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 169667.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.0 MB). Peak memory consumption was 150.7 MB. Max. memory is 11.5 GB. * Witness Printer took 65.48 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 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: 169.6s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 630 SDtfs, 2279 SDslu, 2273 SDs, 0 SdLazy, 2942 SolverSat, 436 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 688 GetRequests, 470 SyntacticMatches, 11 SemanticMatches, 207 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 79.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, 361 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 148.0s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 598 ConstructedInterpolants, 62 QuantifiedInterpolants, 153827 SizeOfPredicates, 122 NumberOfNonLiveVariables, 1178 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 34/74 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...