./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 701f399f 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/memsafety-ext2/complex_data_creation_test02-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-701f399 [2019-11-22 10:13:41,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 10:13:41,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 10:13:41,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 10:13:41,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 10:13:41,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 10:13:41,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 10:13:41,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 10:13:41,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 10:13:41,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 10:13:41,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 10:13:41,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 10:13:41,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 10:13:41,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 10:13:41,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 10:13:41,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 10:13:41,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 10:13:41,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 10:13:41,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 10:13:41,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 10:13:41,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 10:13:41,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 10:13:41,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 10:13:41,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 10:13:41,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 10:13:41,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 10:13:41,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 10:13:41,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 10:13:41,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 10:13:41,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 10:13:41,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 10:13:41,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 10:13:41,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 10:13:41,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 10:13:41,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 10:13:41,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 10:13:41,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 10:13:41,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 10:13:41,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 10:13:41,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 10:13:41,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 10:13:41,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-22 10:13:41,766 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 10:13:41,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 10:13:41,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 10:13:41,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 10:13:41,768 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 10:13:41,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 10:13:41,768 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 10:13:41,769 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 10:13:41,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 10:13:41,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 10:13:41,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 10:13:41,769 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 10:13:41,770 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 10:13:41,770 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 10:13:41,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 10:13:41,770 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 10:13:41,771 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 10:13:41,771 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 10:13:41,771 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 10:13:41,771 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 10:13:41,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 10:13:41,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 10:13:41,772 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 10:13:41,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 10:13:41,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 10:13:41,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 10:13:41,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 10:13:41,773 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 10:13:41,774 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 10:13:41,774 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 10:13:41,774 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c [2019-11-22 10:13:42,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 10:13:42,088 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 10:13:42,092 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 10:13:42,094 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 10:13:42,095 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 10:13:42,096 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-22 10:13:42,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca8790c7/4c19d01ce1d646b69153e51184da95ab/FLAG90d372f7e [2019-11-22 10:13:42,736 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 10:13:42,737 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-22 10:13:42,749 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca8790c7/4c19d01ce1d646b69153e51184da95ab/FLAG90d372f7e [2019-11-22 10:13:43,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca8790c7/4c19d01ce1d646b69153e51184da95ab [2019-11-22 10:13:43,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 10:13:43,079 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 10:13:43,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 10:13:43,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 10:13:43,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 10:13:43,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:13:43" (1/1) ... [2019-11-22 10:13:43,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23456bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:43, skipping insertion in model container [2019-11-22 10:13:43,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:13:43" (1/1) ... [2019-11-22 10:13:43,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 10:13:43,145 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 10:13:43,588 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-22 10:13:43,588 INFO L968 CHandler]: at location: C: (int*) malloc(20 * sizeof(data->array)) [545] [2019-11-22 10:13:43,588 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-22 10:13:43,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 10:13:43,625 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-22 10:13:43,631 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 10:13:43,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 10:13:43,688 INFO L201 MainTranslator]: Completed pre-run [2019-11-22 10:13:43,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 10:13:43,822 INFO L205 MainTranslator]: Completed translation [2019-11-22 10:13:43,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:43 WrapperNode [2019-11-22 10:13:43,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 10:13:43,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 10:13:43,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 10:13:43,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 10:13:43,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:43" (1/1) ... [2019-11-22 10:13:43,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:43" (1/1) ... [2019-11-22 10:13:43,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:43" (1/1) ... [2019-11-22 10:13:43,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:43" (1/1) ... [2019-11-22 10:13:43,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:43" (1/1) ... [2019-11-22 10:13:43,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:43" (1/1) ... [2019-11-22 10:13:43,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:43" (1/1) ... [2019-11-22 10:13:43,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 10:13:43,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 10:13:43,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 10:13:43,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 10:13:43,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 10:13:44,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 10:13:44,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 10:13:44,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 10:13:44,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 10:13:44,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 10:13:44,015 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-22 10:13:44,015 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-22 10:13:44,016 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-22 10:13:44,018 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 10:13:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 10:13:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 10:13:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 10:13:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 10:13:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 10:13:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 10:13:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 10:13:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 10:13:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 10:13:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 10:13:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 10:13:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 10:13:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 10:13:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 10:13:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 10:13:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 10:13:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 10:13:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 10:13:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 10:13:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 10:13:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 10:13:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 10:13:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 10:13:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 10:13:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 10:13:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 10:13:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 10:13:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 10:13:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 10:13:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 10:13:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 10:13:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 10:13:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 10:13:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 10:13:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 10:13:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 10:13:44,026 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 10:13:44,026 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 10:13:44,026 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 10:13:44,026 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 10:13:44,026 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 10:13:44,027 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 10:13:44,027 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 10:13:44,027 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 10:13:44,027 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 10:13:44,027 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 10:13:44,027 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 10:13:44,027 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 10:13:44,027 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 10:13:44,028 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 10:13:44,028 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 10:13:44,029 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 10:13:44,029 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 10:13:44,029 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 10:13:44,029 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 10:13:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 10:13:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 10:13:44,031 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 10:13:44,031 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 10:13:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 10:13:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 10:13:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 10:13:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 10:13:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 10:13:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 10:13:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 10:13:44,033 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 10:13:44,033 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 10:13:44,033 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 10:13:44,034 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 10:13:44,034 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 10:13:44,034 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 10:13:44,034 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 10:13:44,034 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 10:13:44,034 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 10:13:44,034 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 10:13:44,035 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 10:13:44,035 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 10:13:44,035 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 10:13:44,035 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 10:13:44,035 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 10:13:44,035 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 10:13:44,035 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 10:13:44,035 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 10:13:44,036 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 10:13:44,036 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 10:13:44,036 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 10:13:44,036 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 10:13:44,036 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 10:13:44,036 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 10:13:44,036 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 10:13:44,036 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 10:13:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 10:13:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 10:13:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 10:13:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 10:13:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 10:13:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 10:13:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 10:13:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 10:13:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 10:13:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 10:13:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 10:13:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 10:13:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 10:13:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 10:13:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 10:13:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-22 10:13:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 10:13:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-22 10:13:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 10:13:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 10:13:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-22 10:13:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-22 10:13:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 10:13:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-22 10:13:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 10:13:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 10:13:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 10:13:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 10:13:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 10:13:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 10:13:45,341 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 10:13:45,341 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-22 10:13:45,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:13:45 BoogieIcfgContainer [2019-11-22 10:13:45,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 10:13:45,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 10:13:45,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 10:13:45,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 10:13:45,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:13:43" (1/3) ... [2019-11-22 10:13:45,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6a190e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:13:45, skipping insertion in model container [2019-11-22 10:13:45,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:43" (2/3) ... [2019-11-22 10:13:45,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6a190e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:13:45, skipping insertion in model container [2019-11-22 10:13:45,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:13:45" (3/3) ... [2019-11-22 10:13:45,351 INFO L109 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2019-11-22 10:13:45,365 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 10:13:45,373 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 92 error locations. [2019-11-22 10:13:45,385 INFO L249 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2019-11-22 10:13:45,407 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 10:13:45,408 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 10:13:45,408 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 10:13:45,408 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 10:13:45,410 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 10:13:45,410 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 10:13:45,410 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 10:13:45,410 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 10:13:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-11-22 10:13:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-22 10:13:45,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:45,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:13:45,449 INFO L410 AbstractCegarLoop]: === Iteration 1 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 10:13:45,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:45,456 INFO L82 PathProgramCache]: Analyzing trace with hash 696010085, now seen corresponding path program 1 times [2019-11-22 10:13:45,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:45,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1338190605] [2019-11-22 10:13:45,469 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-22 10:13:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:45,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-22 10:13:45,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:45,739 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-22 10:13:45,740 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:45,760 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-22 10:13:45,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1338190605] [2019-11-22 10:13:45,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:13:45,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 10:13:45,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572709751] [2019-11-22 10:13:45,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-22 10:13:45,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:45,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-22 10:13:45,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-22 10:13:45,786 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 2 states. [2019-11-22 10:13:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:45,822 INFO L93 Difference]: Finished difference Result 199 states and 210 transitions. [2019-11-22 10:13:45,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-22 10:13:45,824 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-22 10:13:45,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:45,846 INFO L225 Difference]: With dead ends: 199 [2019-11-22 10:13:45,847 INFO L226 Difference]: Without dead ends: 196 [2019-11-22 10:13:45,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-22 10:13:45,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-22 10:13:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-11-22 10:13:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-22 10:13:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 207 transitions. [2019-11-22 10:13:45,948 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 207 transitions. Word has length 8 [2019-11-22 10:13:45,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:45,949 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 207 transitions. [2019-11-22 10:13:45,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-22 10:13:45,950 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 207 transitions. [2019-11-22 10:13:45,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 10:13:45,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:45,951 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:13:46,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:46,158 INFO L410 AbstractCegarLoop]: === Iteration 2 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 10:13:46,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:46,159 INFO L82 PathProgramCache]: Analyzing trace with hash 101562384, now seen corresponding path program 1 times [2019-11-22 10:13:46,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:46,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1025501387] [2019-11-22 10:13:46,160 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-22 10:13:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:46,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-22 10:13:46,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:46,435 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-22 10:13:46,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:46,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:46,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:13:46,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 10:13:46,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:46,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-22 10:13:46,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:46,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:46,552 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-22 10:13:46,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:17 [2019-11-22 10:13:46,580 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-22 10:13:46,580 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:46,659 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-22 10:13:46,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1025501387] [2019-11-22 10:13:46,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:13:46,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 10:13:46,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613486099] [2019-11-22 10:13:46,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 10:13:46,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:46,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 10:13:46,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:13:46,663 INFO L87 Difference]: Start difference. First operand 196 states and 207 transitions. Second operand 8 states. [2019-11-22 10:13:48,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:48,577 INFO L93 Difference]: Finished difference Result 213 states and 228 transitions. [2019-11-22 10:13:48,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 10:13:48,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-22 10:13:48,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:48,585 INFO L225 Difference]: With dead ends: 213 [2019-11-22 10:13:48,586 INFO L226 Difference]: Without dead ends: 213 [2019-11-22 10:13:48,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-22 10:13:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-22 10:13:48,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2019-11-22 10:13:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-22 10:13:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 205 transitions. [2019-11-22 10:13:48,605 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 205 transitions. Word has length 9 [2019-11-22 10:13:48,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:48,606 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 205 transitions. [2019-11-22 10:13:48,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 10:13:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2019-11-22 10:13:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 10:13:48,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:48,607 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:13:48,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:48,811 INFO L410 AbstractCegarLoop]: === Iteration 3 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 10:13:48,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:48,812 INFO L82 PathProgramCache]: Analyzing trace with hash 101562385, now seen corresponding path program 1 times [2019-11-22 10:13:48,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:48,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [331270105] [2019-11-22 10:13:48,815 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-22 10:13:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:49,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 10:13:49,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:49,102 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-22 10:13:49,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:49,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:49,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:13:49,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-22 10:13:49,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:49,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-22 10:13:49,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:49,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:49,224 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-22 10:13:49,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:22 [2019-11-22 10:13:49,247 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-22 10:13:49,248 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:49,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:49,519 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-22 10:13:49,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [331270105] [2019-11-22 10:13:49,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:13:49,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 10:13:49,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032119313] [2019-11-22 10:13:49,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 10:13:49,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:49,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 10:13:49,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:13:49,522 INFO L87 Difference]: Start difference. First operand 194 states and 205 transitions. Second operand 8 states. [2019-11-22 10:13:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:51,998 INFO L93 Difference]: Finished difference Result 210 states and 225 transitions. [2019-11-22 10:13:51,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 10:13:51,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-22 10:13:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:52,000 INFO L225 Difference]: With dead ends: 210 [2019-11-22 10:13:52,000 INFO L226 Difference]: Without dead ends: 210 [2019-11-22 10:13:52,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-22 10:13:52,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-22 10:13:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 196. [2019-11-22 10:13:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-22 10:13:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 208 transitions. [2019-11-22 10:13:52,014 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 208 transitions. Word has length 9 [2019-11-22 10:13:52,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:52,014 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 208 transitions. [2019-11-22 10:13:52,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 10:13:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 208 transitions. [2019-11-22 10:13:52,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 10:13:52,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:52,015 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:13:52,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:52,219 INFO L410 AbstractCegarLoop]: === Iteration 4 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 10:13:52,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:52,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533154, now seen corresponding path program 1 times [2019-11-22 10:13:52,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:52,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1085314685] [2019-11-22 10:13:52,221 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-22 10:13:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:52,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 10:13:52,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:52,424 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-22 10:13:52,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:52,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:52,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:13:52,429 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 10:13:52,438 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-22 10:13:52,438 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:52,456 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-22 10:13:52,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1085314685] [2019-11-22 10:13:52,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:13:52,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-22 10:13:52,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524999645] [2019-11-22 10:13:52,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:13:52,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:52,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:13:52,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:13:52,458 INFO L87 Difference]: Start difference. First operand 196 states and 208 transitions. Second operand 4 states. [2019-11-22 10:13:52,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:52,832 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2019-11-22 10:13:52,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:13:52,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 10:13:52,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:52,834 INFO L225 Difference]: With dead ends: 194 [2019-11-22 10:13:52,835 INFO L226 Difference]: Without dead ends: 194 [2019-11-22 10:13:52,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:13:52,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-22 10:13:52,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-11-22 10:13:52,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-22 10:13:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 206 transitions. [2019-11-22 10:13:52,846 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 206 transitions. Word has length 10 [2019-11-22 10:13:52,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:52,846 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 206 transitions. [2019-11-22 10:13:52,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:13:52,847 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 206 transitions. [2019-11-22 10:13:52,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 10:13:52,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:52,847 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:13:53,050 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:53,051 INFO L410 AbstractCegarLoop]: === Iteration 5 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 10:13:53,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:53,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533153, now seen corresponding path program 1 times [2019-11-22 10:13:53,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:53,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [319838231] [2019-11-22 10:13:53,053 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-22 10:13:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:53,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 10:13:53,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:53,254 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-22 10:13:53,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:53,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:53,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:13:53,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 10:13:53,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-22 10:13:53,273 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:53,325 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-22 10:13:53,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [319838231] [2019-11-22 10:13:53,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:13:53,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 10:13:53,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279525760] [2019-11-22 10:13:53,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:13:53,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:53,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:13:53,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:13:53,327 INFO L87 Difference]: Start difference. First operand 194 states and 206 transitions. Second operand 4 states. [2019-11-22 10:13:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:54,032 INFO L93 Difference]: Finished difference Result 192 states and 204 transitions. [2019-11-22 10:13:54,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:13:54,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 10:13:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:54,035 INFO L225 Difference]: With dead ends: 192 [2019-11-22 10:13:54,036 INFO L226 Difference]: Without dead ends: 192 [2019-11-22 10:13:54,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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-22 10:13:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-22 10:13:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-11-22 10:13:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-22 10:13:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 204 transitions. [2019-11-22 10:13:54,044 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 204 transitions. Word has length 10 [2019-11-22 10:13:54,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:54,045 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 204 transitions. [2019-11-22 10:13:54,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:13:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 204 transitions. [2019-11-22 10:13:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 10:13:54,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:54,046 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:13:54,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:13:54,249 INFO L410 AbstractCegarLoop]: === Iteration 6 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 10:13:54,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:13:54,250 INFO L82 PathProgramCache]: Analyzing trace with hash -182531198, now seen corresponding path program 1 times [2019-11-22 10:13:54,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:13:54,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1348270294] [2019-11-22 10:13:54,252 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-22 10:13:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:13:54,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 10:13:54,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:13:54,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:54,588 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-22 10:13:54,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:54,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:54,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:13:54,635 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-22 10:13:54,635 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:54,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:54,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 10:13:54,666 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:50, output treesize:24 [2019-11-22 10:13:54,733 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 15 treesize of output 7 [2019-11-22 10:13:54,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:54,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:54,756 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 15 treesize of output 7 [2019-11-22 10:13:54,757 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:13:54,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:13:54,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:13:54,777 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2019-11-22 10:13:54,792 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-22 10:13:54,793 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:13:57,871 WARN L192 SmtUtils]: Spent 824.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-22 10:13:57,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:13:58,073 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-22 10:13:58,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1348270294] [2019-11-22 10:13:58,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:13:58,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-22 10:13:58,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838252798] [2019-11-22 10:13:58,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 10:13:58,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:13:58,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 10:13:58,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-22 10:13:58,075 INFO L87 Difference]: Start difference. First operand 192 states and 204 transitions. Second operand 11 states. [2019-11-22 10:13:59,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:13:59,914 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2019-11-22 10:13:59,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 10:13:59,915 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-11-22 10:13:59,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:13:59,917 INFO L225 Difference]: With dead ends: 197 [2019-11-22 10:13:59,918 INFO L226 Difference]: Without dead ends: 197 [2019-11-22 10:13:59,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-22 10:13:59,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-22 10:13:59,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-11-22 10:13:59,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-22 10:13:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 208 transitions. [2019-11-22 10:13:59,932 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 208 transitions. Word has length 15 [2019-11-22 10:13:59,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:13:59,933 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 208 transitions. [2019-11-22 10:13:59,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 10:13:59,933 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 208 transitions. [2019-11-22 10:13:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 10:13:59,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:13:59,934 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:00,146 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:00,146 INFO L410 AbstractCegarLoop]: === Iteration 7 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 10:14:00,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:00,147 INFO L82 PathProgramCache]: Analyzing trace with hash 675193263, now seen corresponding path program 1 times [2019-11-22 10:14:00,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:00,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [907271101] [2019-11-22 10:14:00,148 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-22 10:14:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:00,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 10:14:00,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:00,418 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-22 10:14:00,418 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:00,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:00,433 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-22 10:14:00,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [907271101] [2019-11-22 10:14:00,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:00,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 10:14:00,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252099880] [2019-11-22 10:14:00,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:14:00,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:00,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:14:00,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:14:00,438 INFO L87 Difference]: Start difference. First operand 196 states and 208 transitions. Second operand 4 states. [2019-11-22 10:14:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:00,485 INFO L93 Difference]: Finished difference Result 273 states and 289 transitions. [2019-11-22 10:14:00,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 10:14:00,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-22 10:14:00,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:00,487 INFO L225 Difference]: With dead ends: 273 [2019-11-22 10:14:00,487 INFO L226 Difference]: Without dead ends: 273 [2019-11-22 10:14:00,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-22 10:14:00,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-22 10:14:00,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 237. [2019-11-22 10:14:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-22 10:14:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 289 transitions. [2019-11-22 10:14:00,495 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 289 transitions. Word has length 17 [2019-11-22 10:14:00,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:00,496 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 289 transitions. [2019-11-22 10:14:00,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:14:00,496 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 289 transitions. [2019-11-22 10:14:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 10:14:00,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:00,497 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-22 10:14:00,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:00,709 INFO L410 AbstractCegarLoop]: === Iteration 8 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 10:14:00,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:00,709 INFO L82 PathProgramCache]: Analyzing trace with hash -543839094, now seen corresponding path program 1 times [2019-11-22 10:14:00,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:00,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1748949275] [2019-11-22 10:14:00,710 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-22 10:14:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:00,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 10:14:00,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:00,994 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_111|], 1=[|v_#valid_151|]} [2019-11-22 10:14:01,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:01,002 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-11-22 10:14:01,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:01,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:01,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:01,023 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-22 10:14:01,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:01,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:01,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:14:01,033 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-22 10:14:01,046 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-22 10:14:01,046 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14: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-22 10:14:01,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1748949275] [2019-11-22 10:14:01,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:01,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 10:14:01,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48635206] [2019-11-22 10:14:01,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:14:01,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:01,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:14:01,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:14:01,115 INFO L87 Difference]: Start difference. First operand 237 states and 289 transitions. Second operand 4 states. [2019-11-22 10:14:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:02,061 INFO L93 Difference]: Finished difference Result 272 states and 333 transitions. [2019-11-22 10:14:02,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 10:14:02,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-22 10:14:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:02,066 INFO L225 Difference]: With dead ends: 272 [2019-11-22 10:14:02,066 INFO L226 Difference]: Without dead ends: 272 [2019-11-22 10:14:02,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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-22 10:14:02,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-22 10:14:02,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 228. [2019-11-22 10:14:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-22 10:14:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 271 transitions. [2019-11-22 10:14:02,074 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 271 transitions. Word has length 18 [2019-11-22 10:14:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:02,075 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 271 transitions. [2019-11-22 10:14:02,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:14:02,075 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 271 transitions. [2019-11-22 10:14:02,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 10:14:02,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:02,076 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-22 10:14:02,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:02,279 INFO L410 AbstractCegarLoop]: === Iteration 9 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 10:14:02,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:02,279 INFO L82 PathProgramCache]: Analyzing trace with hash -543839095, now seen corresponding path program 1 times [2019-11-22 10:14:02,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:02,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [820051656] [2019-11-22 10:14:02,280 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-22 10:14:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:02,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 10:14:02,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:02,559 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-22 10:14:02,560 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 19 treesize of output 18 [2019-11-22 10:14:02,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:02,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:02,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:14:02,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-11-22 10:14:02,595 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-22 10:14:02,595 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:02,609 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-22 10:14:02,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [820051656] [2019-11-22 10:14:02,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:02,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 10:14:02,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705604345] [2019-11-22 10:14:02,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:14:02,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:02,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:14:02,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:14:02,611 INFO L87 Difference]: Start difference. First operand 228 states and 271 transitions. Second operand 4 states. [2019-11-22 10:14:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:03,169 INFO L93 Difference]: Finished difference Result 256 states and 301 transitions. [2019-11-22 10:14:03,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 10:14:03,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-22 10:14:03,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:03,171 INFO L225 Difference]: With dead ends: 256 [2019-11-22 10:14:03,171 INFO L226 Difference]: Without dead ends: 256 [2019-11-22 10:14:03,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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-22 10:14:03,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-22 10:14:03,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 222. [2019-11-22 10:14:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-22 10:14:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 261 transitions. [2019-11-22 10:14:03,179 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 261 transitions. Word has length 18 [2019-11-22 10:14:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:03,180 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 261 transitions. [2019-11-22 10:14:03,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:14:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 261 transitions. [2019-11-22 10:14:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 10:14:03,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:03,181 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] [2019-11-22 10:14:03,383 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:03,384 INFO L410 AbstractCegarLoop]: === Iteration 10 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 10:14:03,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:03,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108428, now seen corresponding path program 1 times [2019-11-22 10:14:03,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:03,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [25944352] [2019-11-22 10:14:03,386 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-22 10:14:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:03,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 10:14:03,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:03,668 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-22 10:14:03,669 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-22 10:14:03,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:03,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:03,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:14:03,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-22 10:14:03,695 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-22 10:14:03,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:03,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:03,706 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-22 10:14:03,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-22 10:14:03,726 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-22 10:14:03,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:03,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:03,737 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-22 10:14:03,737 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-11-22 10:14:03,745 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-22 10:14:03,746 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:03,756 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-22 10:14:03,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [25944352] [2019-11-22 10:14:03,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:03,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 10:14:03,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889878287] [2019-11-22 10:14:03,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 10:14:03,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:03,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 10:14:03,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 10:14:03,759 INFO L87 Difference]: Start difference. First operand 222 states and 261 transitions. Second operand 5 states. [2019-11-22 10:14:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:04,454 INFO L93 Difference]: Finished difference Result 231 states and 267 transitions. [2019-11-22 10:14:04,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 10:14:04,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-22 10:14:04,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:04,459 INFO L225 Difference]: With dead ends: 231 [2019-11-22 10:14:04,459 INFO L226 Difference]: Without dead ends: 231 [2019-11-22 10:14:04,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-22 10:14:04,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-22 10:14:04,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2019-11-22 10:14:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-22 10:14:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 259 transitions. [2019-11-22 10:14:04,468 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 259 transitions. Word has length 22 [2019-11-22 10:14:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:04,468 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 259 transitions. [2019-11-22 10:14:04,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 10:14:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 259 transitions. [2019-11-22 10:14:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 10:14:04,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:04,470 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] [2019-11-22 10:14:04,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:04,675 INFO L410 AbstractCegarLoop]: === Iteration 11 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 10:14:04,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:04,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108427, now seen corresponding path program 1 times [2019-11-22 10:14:04,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:04,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1637688559] [2019-11-22 10:14:04,676 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-22 10:14:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:04,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 10:14:04,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:04,982 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:04,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-22 10:14:04,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:05,022 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-22 10:14:05,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:14:05,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-22 10:14:05,048 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-22 10:14:05,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:05,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:05,079 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-22 10:14:05,079 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:05,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:05,095 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-22 10:14:05,095 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-22 10:14:05,141 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-22 10:14:05,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:05,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:05,159 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-22 10:14:05,160 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:05,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:05,167 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-22 10:14:05,168 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:14 [2019-11-22 10:14:05,190 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-22 10:14:05,190 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:14:05,500 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-22 10:14:05,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1637688559] [2019-11-22 10:14:05,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:14:05,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 10:14:05,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230259051] [2019-11-22 10:14:05,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 10:14:05,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:14:05,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 10:14:05,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-22 10:14:05,502 INFO L87 Difference]: Start difference. First operand 221 states and 259 transitions. Second operand 10 states. [2019-11-22 10:14:08,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:14:08,752 INFO L93 Difference]: Finished difference Result 323 states and 379 transitions. [2019-11-22 10:14:08,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 10:14:08,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-22 10:14:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:14:08,756 INFO L225 Difference]: With dead ends: 323 [2019-11-22 10:14:08,756 INFO L226 Difference]: Without dead ends: 323 [2019-11-22 10:14:08,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-11-22 10:14:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-22 10:14:08,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 237. [2019-11-22 10:14:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-22 10:14:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 277 transitions. [2019-11-22 10:14:08,772 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 277 transitions. Word has length 22 [2019-11-22 10:14:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:14:08,772 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 277 transitions. [2019-11-22 10:14:08,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 10:14:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 277 transitions. [2019-11-22 10:14:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-22 10:14:08,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:14:08,776 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:14:08,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:14:08,980 INFO L410 AbstractCegarLoop]: === Iteration 12 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 10:14:08,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:14:08,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1143894645, now seen corresponding path program 1 times [2019-11-22 10:14:08,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:14:08,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1541855304] [2019-11-22 10:14:08,982 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-22 10:14:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:14:09,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-22 10:14:09,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:14:09,563 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_117|], 1=[|v_#valid_170|]} [2019-11-22 10:14:09,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:09,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-11-22 10:14:09,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:09,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:09,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:09,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-22 10:14:09,611 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:09,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:09,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:14:09,620 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-22 10:14:09,638 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-22 10:14:09,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:09,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:09,659 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-22 10:14:09,660 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:09,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:09,673 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-22 10:14:09,673 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-11-22 10:14:09,767 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_69|], 4=[|v_#memory_$Pointer$.base_70|]} [2019-11-22 10:14:09,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:14:09,781 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 52 treesize of output 45 [2019-11-22 10:14:09,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:09,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:14:09,965 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-11-22 10:14:09,966 INFO L343 Elim1Store]: treesize reduction 38, result has 66.4 percent of original size [2019-11-22 10:14:09,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 142 [2019-11-22 10:14:09,968 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:14:10,080 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-11-22 10:14:10,081 INFO L567 ElimStorePlain]: treesize reduction 89, result has 51.1 percent of original size [2019-11-22 10:14:10,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:14:10,082 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:154, output treesize:93 [2019-11-22 10:14:16,153 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-22 10:14:18,262 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-22 10:14:20,365 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-22 10:14:20,900 WARN L192 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-22 10:14:20,901 INFO L343 Elim1Store]: treesize reduction 18, result has 92.2 percent of original size [2019-11-22 10:14:20,901 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 287 [2019-11-22 10:14:20,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:20,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:20,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:20,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:20,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:20,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:20,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:14:21,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:14:21,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 27 xjuncts. [2019-11-22 10:15:26,914 WARN L192 SmtUtils]: Spent 1.09 m on a formula simplification. DAG size of input: 496 DAG size of output: 63 [2019-11-22 10:15:26,915 INFO L567 ElimStorePlain]: treesize reduction 68542, result has 0.6 percent of original size [2019-11-22 10:15:27,455 WARN L192 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-22 10:15:27,456 INFO L343 Elim1Store]: treesize reduction 18, result has 94.0 percent of original size [2019-11-22 10:15:27,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 380 treesize of output 482 [2019-11-22 10:15:27,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:15:27,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:15:27,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:15:27,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:15:27,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:15:27,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:15:27,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:15:27,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:15:27,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:15:27,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:15:27,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:15:27,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:15:27,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:15:27,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:15:27,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:15:27,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:15:27,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:15:27,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:15:27,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:15:27,480 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-22 10:15:57,143 WARN L192 SmtUtils]: Spent 29.66 s on a formula simplification. DAG size of input: 117 DAG size of output: 65 [2019-11-22 10:15:57,144 INFO L567 ElimStorePlain]: treesize reduction 13133, result has 4.1 percent of original size [2019-11-22 10:15:57,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:15:57,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:15:57,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:15:57,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:15:57,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 10:15:57,155 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:180, output treesize:461 [2019-11-22 10:15:57,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:15:57,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:15:57,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:15:57,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:09,433 WARN L192 SmtUtils]: Spent 6.14 s on a formula simplification. DAG size of input: 109 DAG size of output: 43 [2019-11-22 10:16:09,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:15,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:19,686 WARN L192 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-11-22 10:16:19,691 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 6=[|#memory_$Pointer$.offset|]} [2019-11-22 10:16:19,696 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 50 treesize of output 26 [2019-11-22 10:16:19,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:16:19,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:16:19,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:16:19,738 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-22 10:16:19,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2019-11-22 10:16:19,740 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:16:19,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:16:19,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:16:19,753 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:78, output treesize:21 [2019-11-22 10:16:19,801 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:16:19,802 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:16:20,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:20,232 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-22 10:16:20,251 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:16:20,357 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-22 10:16:20,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:16:20,367 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:16:20,395 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:16:20,525 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-22 10:16:20,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:16:20,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-22 10:16:20,527 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:148, output treesize:141 [2019-11-22 10:16:29,481 WARN L192 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 52 [2019-11-22 10:16:31,529 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3)) (.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse2 (store (select |c_#memory_$Pointer$.offset| .cse1) (bvadd .cse0 v_prenex_9 (_ bv3 32)) v_DerPreprocessor_3)) (.cse4 (bvadd .cse0 v_prenex_9))) (or (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 .cse2) c_create_data_~data~0.base) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse4 v_DerPreprocessor_1)) c_create_data_~data~0.base) .cse3))) (not (= v_DerPreprocessor_3 (select .cse2 .cse4)))))))) (forall ((|create_data_#t~mem8.offset| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32))) (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse9)) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse8 (store (select |c_#memory_$Pointer$.offset| .cse7) (bvadd .cse5 |create_data_#t~mem8.offset| (_ bv3 32)) v_DerPreprocessor_4))) (or (let ((.cse6 (select (select (store |c_#memory_$Pointer$.offset| .cse7 .cse8) c_create_data_~data~0.base) .cse9))) (bvule (bvadd .cse5 .cse6 (_ bv4 32)) (bvadd .cse5 .cse6 (_ bv8 32)))) (not (= v_DerPreprocessor_4 (select .cse8 (bvadd .cse5 |create_data_#t~mem8.offset|)))))))))) is different from false [2019-11-22 10:16:38,761 WARN L192 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 54 [2019-11-22 10:16:38,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:16:38,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:16:38,974 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-22 10:16:38,981 INFO L168 Benchmark]: Toolchain (without parser) took 175902.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.7 MB). Free memory was 956.3 MB in the beginning and 1.3 GB in the end (delta: -350.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 10:16:38,981 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 10:16:38,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-22 10:16:38,982 INFO L168 Benchmark]: Boogie Preprocessor took 94.55 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-22 10:16:38,982 INFO L168 Benchmark]: RCFGBuilder took 1422.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.2 MB). Peak memory consumption was 91.2 MB. Max. memory is 11.5 GB. [2019-11-22 10:16:38,982 INFO L168 Benchmark]: TraceAbstraction took 173635.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -266.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 10:16:38,986 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 743.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 94.55 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 1422.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.2 MB). Peak memory consumption was 91.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 173635.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -266.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...