./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 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3d056a1f 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-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c ......................................................................................................................... Execution finished normally 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-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- This is Ultimate 0.1.24-3d056a1 [2019-11-22 13:55:37,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 13:55:37,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 13:55:37,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 13:55:37,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 13:55:37,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 13:55:37,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 13:55:37,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 13:55:37,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 13:55:37,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 13:55:37,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 13:55:37,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 13:55:37,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 13:55:37,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 13:55:37,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 13:55:37,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 13:55:37,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 13:55:37,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 13:55:37,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 13:55:37,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 13:55:37,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 13:55:37,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 13:55:37,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 13:55:37,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 13:55:37,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 13:55:37,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 13:55:37,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 13:55:37,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 13:55:37,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 13:55:37,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 13:55:37,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 13:55:37,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 13:55:37,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 13:55:37,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 13:55:37,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 13:55:37,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 13:55:37,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 13:55:37,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 13:55:37,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 13:55:37,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 13:55:37,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 13:55:37,779 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-22 13:55:37,812 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 13:55:37,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 13:55:37,814 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 13:55:37,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 13:55:37,814 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 13:55:37,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 13:55:37,815 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 13:55:37,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 13:55:37,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 13:55:37,816 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 13:55:37,816 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 13:55:37,816 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 13:55:37,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 13:55:37,816 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 13:55:37,817 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 13:55:37,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 13:55:37,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 13:55:37,817 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 13:55:37,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 13:55:37,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 13:55:37,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 13:55:37,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 13:55:37,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 13:55:37,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 13:55:37,819 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c [2019-11-22 13:55:38,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 13:55:38,127 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 13:55:38,131 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 13:55:38,133 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 13:55:38,133 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 13:55:38,134 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 13:55:38,215 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/046c62d12/1d42d333ba4747ad906d13164db9375b/FLAGbb27ef56a [2019-11-22 13:55:38,785 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 13:55:38,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-22 13:55:38,800 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/046c62d12/1d42d333ba4747ad906d13164db9375b/FLAGbb27ef56a [2019-11-22 13:55:39,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/046c62d12/1d42d333ba4747ad906d13164db9375b [2019-11-22 13:55:39,014 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 13:55:39,016 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 13:55:39,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 13:55:39,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 13:55:39,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 13:55:39,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:55:39" (1/1) ... [2019-11-22 13:55:39,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@781e2542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:55:39, skipping insertion in model container [2019-11-22 13:55:39,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:55:39" (1/1) ... [2019-11-22 13:55:39,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 13:55:39,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 13:55:39,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:55:39,543 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-11-22 13:55:39,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@56878bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:55:39, skipping insertion in model container [2019-11-22 13:55:39,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 13:55:39,545 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-22 13:55:39,548 INFO L168 Benchmark]: Toolchain (without parser) took 531.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -196.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-11-22 13:55:39,549 INFO L168 Benchmark]: CDTParser took 0.31 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 13:55:39,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 527.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -196.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-11-22 13:55:39,552 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.31 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 527.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -196.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 545]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-3d056a1 [2019-11-22 13:55:41,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 13:55:41,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 13:55:41,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 13:55:41,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 13:55:41,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 13:55:41,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 13:55:41,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 13:55:41,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 13:55:41,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 13:55:41,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 13:55:41,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 13:55:41,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 13:55:41,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 13:55:41,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 13:55:41,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 13:55:41,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 13:55:41,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 13:55:41,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 13:55:41,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 13:55:41,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 13:55:41,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 13:55:41,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 13:55:41,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 13:55:41,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 13:55:41,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 13:55:41,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 13:55:41,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 13:55:41,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 13:55:41,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 13:55:41,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 13:55:41,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 13:55:41,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 13:55:41,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 13:55:41,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 13:55:41,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 13:55:41,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 13:55:41,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 13:55:41,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 13:55:41,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 13:55:41,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 13:55:41,493 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-22 13:55:41,507 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 13:55:41,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 13:55:41,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 13:55:41,509 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 13:55:41,509 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 13:55:41,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 13:55:41,510 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 13:55:41,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 13:55:41,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 13:55:41,510 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 13:55:41,510 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 13:55:41,511 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 13:55:41,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 13:55:41,511 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 13:55:41,511 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 13:55:41,511 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 13:55:41,512 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 13:55:41,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 13:55:41,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 13:55:41,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 13:55:41,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 13:55:41,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 13:55:41,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 13:55:41,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 13:55:41,513 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 13:55:41,514 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 13:55:41,514 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 13:55:41,514 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c [2019-11-22 13:55:41,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 13:55:41,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 13:55:41,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 13:55:41,863 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 13:55:41,864 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 13:55:41,864 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 13:55:41,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cac72d70/d4d2b339424f4a4e8538728468202f6d/FLAGa2f9fecdb [2019-11-22 13:55:42,572 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 13:55:42,575 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-22 13:55:42,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cac72d70/d4d2b339424f4a4e8538728468202f6d/FLAGa2f9fecdb [2019-11-22 13:55:42,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cac72d70/d4d2b339424f4a4e8538728468202f6d [2019-11-22 13:55:42,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 13:55:42,782 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 13:55:42,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 13:55:42,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 13:55:42,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 13:55:42,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:55:42" (1/1) ... [2019-11-22 13:55:42,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13413829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:55:42, skipping insertion in model container [2019-11-22 13:55:42,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:55:42" (1/1) ... [2019-11-22 13:55:42,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 13:55:42,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 13:55:43,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:55:43,337 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-22 13:55:43,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 13:55:43,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:55:43,398 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 13:55:43,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:55:43,553 INFO L208 MainTranslator]: Completed translation [2019-11-22 13:55:43,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:55:43 WrapperNode [2019-11-22 13:55:43,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 13:55:43,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 13:55:43,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 13:55:43,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 13:55:43,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:55:43" (1/1) ... [2019-11-22 13:55:43,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:55:43" (1/1) ... [2019-11-22 13:55:43,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:55:43" (1/1) ... [2019-11-22 13:55:43,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:55:43" (1/1) ... [2019-11-22 13:55:43,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:55:43" (1/1) ... [2019-11-22 13:55:43,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:55:43" (1/1) ... [2019-11-22 13:55:43,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:55:43" (1/1) ... [2019-11-22 13:55:43,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 13:55:43,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 13:55:43,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 13:55:43,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 13:55:43,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:55: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 13:55:43,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 13:55:43,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 13:55:43,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 13:55:43,717 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 13:55:43,718 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 13:55:43,718 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-22 13:55:43,718 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-22 13:55:43,718 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-22 13:55:43,718 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 13:55:43,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 13:55:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 13:55:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 13:55:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 13:55:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 13:55:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 13:55:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 13:55:43,720 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 13:55:43,720 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 13:55:43,720 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 13:55:43,720 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 13:55:43,721 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 13:55:43,721 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 13:55:43,721 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 13:55:43,721 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 13:55:43,721 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 13:55:43,721 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 13:55:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 13:55:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 13:55:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 13:55:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 13:55:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 13:55:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 13:55:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 13:55:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 13:55:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 13:55:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 13:55:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 13:55:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 13:55:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 13:55:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 13:55:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 13:55:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 13:55:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 13:55:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 13:55:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 13:55:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 13:55:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 13:55:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 13:55:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 13:55:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 13:55:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 13:55:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 13:55:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 13:55:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 13:55:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 13:55:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 13:55:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 13:55:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 13:55:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 13:55:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 13:55:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 13:55:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 13:55:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 13:55:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 13:55:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 13:55:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 13:55:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 13:55:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 13:55:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 13:55:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 13:55:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 13:55:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 13:55:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 13:55:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 13:55:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 13:55:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 13:55:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 13:55:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 13:55:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 13:55:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 13:55:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 13:55:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 13:55:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 13:55:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 13:55:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 13:55:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 13:55:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 13:55:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 13:55:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 13:55:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 13:55:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 13:55:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 13:55:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 13:55:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 13:55:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 13:55:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 13:55:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 13:55:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 13:55:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 13:55:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 13:55:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 13:55:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 13:55:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 13:55:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 13:55:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 13:55:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 13:55:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 13:55:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 13:55:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 13:55:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 13:55:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 13:55:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 13:55:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 13:55:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 13:55:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 13:55:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 13:55:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-22 13:55:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 13:55:43,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-22 13:55:43,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 13:55:43,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 13:55:43,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-22 13:55:43,736 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-22 13:55:43,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 13:55:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-22 13:55:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 13:55:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 13:55:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 13:55:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 13:55:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 13:55:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 13:55:45,066 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 13:55:45,067 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-22 13:55:45,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:55:45 BoogieIcfgContainer [2019-11-22 13:55:45,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 13:55:45,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 13:55:45,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 13:55:45,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 13:55:45,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:55:42" (1/3) ... [2019-11-22 13:55:45,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcb65ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:55:45, skipping insertion in model container [2019-11-22 13:55:45,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:55:43" (2/3) ... [2019-11-22 13:55:45,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcb65ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:55:45, skipping insertion in model container [2019-11-22 13:55:45,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:55:45" (3/3) ... [2019-11-22 13:55:45,098 INFO L109 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2019-11-22 13:55:45,111 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 13:55:45,121 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 92 error locations. [2019-11-22 13:55:45,133 INFO L249 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2019-11-22 13:55:45,155 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 13:55:45,156 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 13:55:45,156 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 13:55:45,156 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 13:55:45,156 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 13:55:45,157 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 13:55:45,157 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 13:55:45,157 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 13:55:45,190 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-11-22 13:55:45,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-22 13:55:45,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:45,205 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:55:45,207 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 13:55:45,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:45,215 INFO L82 PathProgramCache]: Analyzing trace with hash 696010085, now seen corresponding path program 1 times [2019-11-22 13:55:45,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:55:45,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1357429438] [2019-11-22 13:55:45,229 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 13:55:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:45,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-22 13:55:45,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:55:45,529 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 13:55:45,530 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:55:45,547 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 13:55:45,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1357429438] [2019-11-22 13:55:45,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:55:45,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 13:55:45,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542995675] [2019-11-22 13:55:45,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-22 13:55:45,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:55:45,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-22 13:55:45,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-22 13:55:45,576 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 2 states. [2019-11-22 13:55:45,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:55:45,609 INFO L93 Difference]: Finished difference Result 199 states and 210 transitions. [2019-11-22 13:55:45,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-22 13:55:45,610 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-22 13:55:45,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:55:45,624 INFO L225 Difference]: With dead ends: 199 [2019-11-22 13:55:45,624 INFO L226 Difference]: Without dead ends: 196 [2019-11-22 13:55:45,626 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 13:55:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-22 13:55:45,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-11-22 13:55:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-22 13:55:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 207 transitions. [2019-11-22 13:55:45,685 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 207 transitions. Word has length 8 [2019-11-22 13:55:45,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:55:45,686 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 207 transitions. [2019-11-22 13:55:45,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-22 13:55:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 207 transitions. [2019-11-22 13:55:45,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 13:55:45,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:45,687 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:55:45,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:55:45,891 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 13:55:45,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:45,892 INFO L82 PathProgramCache]: Analyzing trace with hash 101562384, now seen corresponding path program 1 times [2019-11-22 13:55:45,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:55:45,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1761354348] [2019-11-22 13:55:45,894 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 13:55:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:46,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-22 13:55:46,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:55:46,165 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 13:55:46,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:46,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:46,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:55:46,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 13:55:46,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:46,250 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 13:55:46,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:46,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:46,272 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 13:55:46,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:17 [2019-11-22 13:55:46,303 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 13:55:46,304 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:55:46,392 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 13:55:46,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1761354348] [2019-11-22 13:55:46,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:55:46,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 13:55:46,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127243465] [2019-11-22 13:55:46,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:55:46,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:55:46,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:55:46,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:55:46,396 INFO L87 Difference]: Start difference. First operand 196 states and 207 transitions. Second operand 8 states. [2019-11-22 13:55:48,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:55:48,428 INFO L93 Difference]: Finished difference Result 213 states and 228 transitions. [2019-11-22 13:55:48,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:55:48,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-22 13:55:48,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:55:48,435 INFO L225 Difference]: With dead ends: 213 [2019-11-22 13:55:48,435 INFO L226 Difference]: Without dead ends: 213 [2019-11-22 13:55:48,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:55:48,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-22 13:55:48,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2019-11-22 13:55:48,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-22 13:55:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 205 transitions. [2019-11-22 13:55:48,455 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 205 transitions. Word has length 9 [2019-11-22 13:55:48,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:55:48,456 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 205 transitions. [2019-11-22 13:55:48,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:55:48,456 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2019-11-22 13:55:48,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 13:55:48,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:48,457 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:55:48,660 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:55:48,660 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 13:55:48,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:48,661 INFO L82 PathProgramCache]: Analyzing trace with hash 101562385, now seen corresponding path program 1 times [2019-11-22 13:55:48,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:55:48,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1324367866] [2019-11-22 13:55:48,662 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 13:55:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:48,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 13:55:48,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:55:48,936 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 13:55:48,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:48,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:48,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:55:48,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-22 13:55:49,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:49,011 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 13:55:49,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:49,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:49,029 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 13:55:49,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:22 [2019-11-22 13:55:49,055 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 13:55:49,055 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:55:49,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,296 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 13:55:49,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1324367866] [2019-11-22 13:55:49,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:55:49,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 13:55:49,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199188747] [2019-11-22 13:55:49,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:55:49,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:55:49,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:55:49,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:55:49,299 INFO L87 Difference]: Start difference. First operand 194 states and 205 transitions. Second operand 8 states. [2019-11-22 13:55:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:55:51,900 INFO L93 Difference]: Finished difference Result 210 states and 225 transitions. [2019-11-22 13:55:51,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 13:55:51,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-22 13:55:51,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:55:51,903 INFO L225 Difference]: With dead ends: 210 [2019-11-22 13:55:51,903 INFO L226 Difference]: Without dead ends: 210 [2019-11-22 13:55:51,903 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 13:55:51,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-22 13:55:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 196. [2019-11-22 13:55:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-22 13:55:51,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 208 transitions. [2019-11-22 13:55:51,921 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 208 transitions. Word has length 9 [2019-11-22 13:55:51,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:55:51,922 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 208 transitions. [2019-11-22 13:55:51,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:55:51,922 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 208 transitions. [2019-11-22 13:55:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 13:55:51,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:51,923 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:55:52,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:55:52,127 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 13:55:52,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:52,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533154, now seen corresponding path program 1 times [2019-11-22 13:55:52,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:55:52,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [477693044] [2019-11-22 13:55:52,131 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 13:55:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:52,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 13:55:52,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:55:52,317 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 13:55:52,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:52,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 13:55:52,341 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 13:55:52,342 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:55:52,370 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 13:55:52,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [477693044] [2019-11-22 13:55:52,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:55:52,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-22 13:55:52,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310464363] [2019-11-22 13:55:52,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:55:52,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:55:52,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:55:52,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:55:52,373 INFO L87 Difference]: Start difference. First operand 196 states and 208 transitions. Second operand 4 states. [2019-11-22 13:55:52,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:55:52,758 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2019-11-22 13:55:52,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 13:55:52,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 13:55:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:55:52,760 INFO L225 Difference]: With dead ends: 194 [2019-11-22 13:55:52,760 INFO L226 Difference]: Without dead ends: 194 [2019-11-22 13:55:52,761 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 13:55:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-22 13:55:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-11-22 13:55:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-22 13:55:52,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 206 transitions. [2019-11-22 13:55:52,776 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 206 transitions. Word has length 10 [2019-11-22 13:55:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:55:52,776 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 206 transitions. [2019-11-22 13:55:52,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:55:52,776 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 206 transitions. [2019-11-22 13:55:52,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 13:55:52,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:52,777 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:55:52,983 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:55:52,983 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 13:55:52,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:52,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533153, now seen corresponding path program 1 times [2019-11-22 13:55:52,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:55:52,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [607622453] [2019-11-22 13:55:52,985 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 13:55:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:53,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 13:55:53,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:55:53,191 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 13:55:53,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:53,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 13:55:53,210 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 13:55:53,210 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:55:53,281 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 13:55:53,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [607622453] [2019-11-22 13:55:53,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:55:53,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 13:55:53,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300815451] [2019-11-22 13:55:53,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:55:53,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:55:53,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:55:53,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:55:53,285 INFO L87 Difference]: Start difference. First operand 194 states and 206 transitions. Second operand 4 states. [2019-11-22 13:55:54,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:55:54,013 INFO L93 Difference]: Finished difference Result 192 states and 204 transitions. [2019-11-22 13:55:54,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 13:55:54,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 13:55:54,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:55:54,016 INFO L225 Difference]: With dead ends: 192 [2019-11-22 13:55:54,017 INFO L226 Difference]: Without dead ends: 192 [2019-11-22 13:55:54,017 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 13:55:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-22 13:55:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-11-22 13:55:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-22 13:55:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 204 transitions. [2019-11-22 13:55:54,031 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 204 transitions. Word has length 10 [2019-11-22 13:55:54,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:55:54,031 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 204 transitions. [2019-11-22 13:55:54,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:55:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 204 transitions. [2019-11-22 13:55:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 13:55:54,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:54,032 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:55:54,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:55:54,236 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 13:55:54,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:54,237 INFO L82 PathProgramCache]: Analyzing trace with hash -182531198, now seen corresponding path program 1 times [2019-11-22 13:55:54,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:55:54,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1437862185] [2019-11-22 13:55:54,238 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 13:55:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:54,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 13:55:54,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:55:54,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:54,563 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 13:55:54,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:54,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:54,618 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 13:55:54,618 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:54,647 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 13:55:54,647 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:50, output treesize:24 [2019-11-22 13:55:54,695 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 13:55:54,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:54,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-22 13:55:54,726 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:54,747 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 13:55:54,747 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2019-11-22 13:55:54,764 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 13:55:54,764 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:55:54,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,110 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 13:55:55,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1437862185] [2019-11-22 13:55:55,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:55:55,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-22 13:55:55,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275787843] [2019-11-22 13:55:55,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 13:55:55,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:55:55,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 13:55:55,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-22 13:55:55,112 INFO L87 Difference]: Start difference. First operand 192 states and 204 transitions. Second operand 11 states. [2019-11-22 13:55:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:55:57,016 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2019-11-22 13:55:57,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 13:55:57,017 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-11-22 13:55:57,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:55:57,019 INFO L225 Difference]: With dead ends: 197 [2019-11-22 13:55:57,019 INFO L226 Difference]: Without dead ends: 197 [2019-11-22 13:55:57,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-22 13:55:57,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-22 13:55:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-11-22 13:55:57,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-22 13:55:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 208 transitions. [2019-11-22 13:55:57,046 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 208 transitions. Word has length 15 [2019-11-22 13:55:57,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:55:57,046 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 208 transitions. [2019-11-22 13:55:57,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 13:55:57,047 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 208 transitions. [2019-11-22 13:55:57,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 13:55:57,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:57,049 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 13:55:57,260 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:55:57,261 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 13:55:57,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:57,261 INFO L82 PathProgramCache]: Analyzing trace with hash 675193263, now seen corresponding path program 1 times [2019-11-22 13:55:57,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:55:57,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1870789682] [2019-11-22 13:55:57,262 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 13:55:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:57,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 13:55:57,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:55:57,506 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 13:55:57,506 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:55:57,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:57,523 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 13:55:57,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1870789682] [2019-11-22 13:55:57,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:55:57,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 13:55:57,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172241293] [2019-11-22 13:55:57,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:55:57,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:55:57,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:55:57,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:55:57,528 INFO L87 Difference]: Start difference. First operand 196 states and 208 transitions. Second operand 4 states. [2019-11-22 13:55:57,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:55:57,579 INFO L93 Difference]: Finished difference Result 273 states and 289 transitions. [2019-11-22 13:55:57,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 13:55:57,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-22 13:55:57,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:55:57,582 INFO L225 Difference]: With dead ends: 273 [2019-11-22 13:55:57,583 INFO L226 Difference]: Without dead ends: 273 [2019-11-22 13:55:57,583 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 13:55:57,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-22 13:55:57,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 237. [2019-11-22 13:55:57,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-22 13:55:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 289 transitions. [2019-11-22 13:55:57,616 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 289 transitions. Word has length 17 [2019-11-22 13:55:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:55:57,616 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 289 transitions. [2019-11-22 13:55:57,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:55:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 289 transitions. [2019-11-22 13:55:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 13:55:57,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:57,618 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 13:55:57,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:55:57,825 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 13:55:57,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:57,826 INFO L82 PathProgramCache]: Analyzing trace with hash -543839094, now seen corresponding path program 1 times [2019-11-22 13:55:57,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:55:57,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1311367481] [2019-11-22 13:55:57,826 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 13:55:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:58,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 13:55:58,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:55:58,084 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_111|], 1=[|v_#valid_151|]} [2019-11-22 13:55:58,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,092 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 13:55:58,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:58,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:58,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,129 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 13:55:58,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:58,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:58,141 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 13:55:58,142 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-22 13:55:58,154 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 13:55:58,155 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:55:58,225 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 13:55:58,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1311367481] [2019-11-22 13:55:58,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:55:58,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 13:55:58,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312856681] [2019-11-22 13:55:58,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:55:58,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:55:58,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:55:58,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:55:58,227 INFO L87 Difference]: Start difference. First operand 237 states and 289 transitions. Second operand 4 states. [2019-11-22 13:55:59,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:55:59,267 INFO L93 Difference]: Finished difference Result 272 states and 333 transitions. [2019-11-22 13:55:59,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 13:55:59,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-22 13:55:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:55:59,270 INFO L225 Difference]: With dead ends: 272 [2019-11-22 13:55:59,270 INFO L226 Difference]: Without dead ends: 272 [2019-11-22 13:55:59,271 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 13:55:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-22 13:55:59,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 228. [2019-11-22 13:55:59,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-22 13:55:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 271 transitions. [2019-11-22 13:55:59,278 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 271 transitions. Word has length 18 [2019-11-22 13:55:59,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:55:59,279 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 271 transitions. [2019-11-22 13:55:59,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:55:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 271 transitions. [2019-11-22 13:55:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 13:55:59,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:59,280 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 13:55:59,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:55:59,481 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 13:55:59,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:59,482 INFO L82 PathProgramCache]: Analyzing trace with hash -543839095, now seen corresponding path program 1 times [2019-11-22 13:55:59,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:55:59,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1042334470] [2019-11-22 13:55:59,483 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 13:55:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:59,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 13:55:59,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:55:59,729 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-22 13:55:59,730 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 13:55:59,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:59,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:59,740 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 13:55:59,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-11-22 13:55:59,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 13:55:59,761 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:55:59,772 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 13:55:59,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1042334470] [2019-11-22 13:55:59,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:55:59,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 13:55:59,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795045344] [2019-11-22 13:55:59,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:55:59,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:55:59,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:55:59,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:55:59,773 INFO L87 Difference]: Start difference. First operand 228 states and 271 transitions. Second operand 4 states. [2019-11-22 13:56:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:00,313 INFO L93 Difference]: Finished difference Result 256 states and 301 transitions. [2019-11-22 13:56:00,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 13:56:00,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-22 13:56:00,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:00,316 INFO L225 Difference]: With dead ends: 256 [2019-11-22 13:56:00,316 INFO L226 Difference]: Without dead ends: 256 [2019-11-22 13:56:00,317 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 13:56:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-22 13:56:00,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 222. [2019-11-22 13:56:00,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-22 13:56:00,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 261 transitions. [2019-11-22 13:56:00,324 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 261 transitions. Word has length 18 [2019-11-22 13:56:00,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:00,324 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 261 transitions. [2019-11-22 13:56:00,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:56:00,324 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 261 transitions. [2019-11-22 13:56:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 13:56:00,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:00,325 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 13:56:00,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:00,530 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 13:56:00,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:00,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108428, now seen corresponding path program 1 times [2019-11-22 13:56:00,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:00,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1912946281] [2019-11-22 13:56:00,532 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 13:56:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:00,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 13:56:00,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:00,777 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-22 13:56:00,777 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 13:56:00,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:00,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:00,784 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 13:56:00,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-22 13:56:00,806 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 13:56:00,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:00,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:00,823 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 13:56:00,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-22 13:56:00,839 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 13:56:00,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:00,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:00,846 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 13:56:00,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-11-22 13:56:00,856 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 13:56:00,856 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:56:00,863 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 13:56:00,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1912946281] [2019-11-22 13:56:00,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:56:00,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 13:56:00,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677553470] [2019-11-22 13:56:00,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 13:56:00,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:56:00,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 13:56:00,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:56:00,866 INFO L87 Difference]: Start difference. First operand 222 states and 261 transitions. Second operand 5 states. [2019-11-22 13:56:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:01,595 INFO L93 Difference]: Finished difference Result 231 states and 267 transitions. [2019-11-22 13:56:01,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 13:56:01,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-22 13:56:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:01,599 INFO L225 Difference]: With dead ends: 231 [2019-11-22 13:56:01,599 INFO L226 Difference]: Without dead ends: 231 [2019-11-22 13:56:01,599 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 13:56:01,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-22 13:56:01,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2019-11-22 13:56:01,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-22 13:56:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 259 transitions. [2019-11-22 13:56:01,607 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 259 transitions. Word has length 22 [2019-11-22 13:56:01,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:01,607 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 259 transitions. [2019-11-22 13:56:01,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 13:56:01,607 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 259 transitions. [2019-11-22 13:56:01,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 13:56:01,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:01,608 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 13:56:01,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:01,817 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 13:56:01,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:01,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108427, now seen corresponding path program 1 times [2019-11-22 13:56:01,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:01,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1662289805] [2019-11-22 13:56:01,819 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 13:56:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:02,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 13:56:02,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:02,085 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:02,086 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 13:56:02,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:02,115 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-22 13:56:02,116 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 13:56:02,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-22 13:56:02,130 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 13:56:02,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:02,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:02,152 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 13:56:02,152 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:02,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:02,163 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 13:56:02,163 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2019-11-22 13:56:02,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-22 13:56:02,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:02,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:02,239 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 13:56:02,240 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:02,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:02,254 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 13:56:02,254 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-22 13:56:02,281 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 13:56:02,282 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:56:02,454 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-11-22 13:56:02,657 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 13:56:02,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1662289805] [2019-11-22 13:56:02,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:56:02,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 13:56:02,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336257957] [2019-11-22 13:56:02,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 13:56:02,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:56:02,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 13:56:02,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:56:02,660 INFO L87 Difference]: Start difference. First operand 221 states and 259 transitions. Second operand 10 states. [2019-11-22 13:56:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:05,863 INFO L93 Difference]: Finished difference Result 323 states and 379 transitions. [2019-11-22 13:56:05,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 13:56:05,865 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-22 13:56:05,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:05,867 INFO L225 Difference]: With dead ends: 323 [2019-11-22 13:56:05,867 INFO L226 Difference]: Without dead ends: 323 [2019-11-22 13:56:05,868 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 13:56:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-22 13:56:05,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 237. [2019-11-22 13:56:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-22 13:56:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 277 transitions. [2019-11-22 13:56:05,877 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 277 transitions. Word has length 22 [2019-11-22 13:56:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:05,877 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 277 transitions. [2019-11-22 13:56:05,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 13:56:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 277 transitions. [2019-11-22 13:56:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-22 13:56:05,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:05,878 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 13:56:06,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:06,083 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 13:56:06,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:06,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1143894645, now seen corresponding path program 1 times [2019-11-22 13:56:06,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:06,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [962696591] [2019-11-22 13:56:06,085 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 13:56:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:06,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-22 13:56:06,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:06,640 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_117|], 1=[|v_#valid_170|]} [2019-11-22 13:56:06,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,647 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 13:56:06,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,668 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 13:56:06,670 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,680 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-22 13:56:06,698 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 13:56:06,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,730 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 13:56:06,730 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,745 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 13:56:06,746 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:28 [2019-11-22 13:56:06,825 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_69|], 4=[|v_#memory_$Pointer$.base_70|]} [2019-11-22 13:56:06,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,839 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 13:56:06,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:07,049 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-11-22 13:56:07,050 INFO L343 Elim1Store]: treesize reduction 38, result has 66.4 percent of original size [2019-11-22 13:56:07,050 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 129 treesize of output 144 [2019-11-22 13:56:07,052 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:07,131 INFO L567 ElimStorePlain]: treesize reduction 89, result has 51.1 percent of original size [2019-11-22 13:56:07,132 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 13:56:07,132 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:156, output treesize:93 [2019-11-22 13:56:13,199 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 40 [2019-11-22 13:56:15,298 WARN L192 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-22 13:56:17,390 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 44 [2019-11-22 13:56:17,849 WARN L192 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-22 13:56:17,849 INFO L343 Elim1Store]: treesize reduction 18, result has 92.2 percent of original size [2019-11-22 13:56:17,850 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 163 treesize of output 289 [2019-11-22 13:56:17,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:17,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:17,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:17,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:17,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:17,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:17,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:17,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:17,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:17,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:17,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:17,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:17,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:17,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:17,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:17,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:17,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:17,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:17,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:56:18,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 27 xjuncts. [2019-11-22 13:57:06,487 WARN L192 SmtUtils]: Spent 48.10 s on a formula simplification. DAG size of input: 463 DAG size of output: 63 [2019-11-22 13:57:06,488 INFO L567 ElimStorePlain]: treesize reduction 66548, result has 0.6 percent of original size [2019-11-22 13:57:07,039 WARN L192 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-22 13:57:07,040 INFO L343 Elim1Store]: treesize reduction 18, result has 94.0 percent of original size [2019-11-22 13:57:07,040 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 13:57:07,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:07,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:57:07,166 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 12 xjuncts. [2019-11-22 13:58:10,791 WARN L192 SmtUtils]: Spent 1.06 m on a formula simplification. DAG size of input: 343 DAG size of output: 61 [2019-11-22 13:58:10,792 INFO L567 ElimStorePlain]: treesize reduction 74919, result has 0.6 percent of original size [2019-11-22 13:58:10,796 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 13:58:10,797 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:182, output treesize:377 [2019-11-22 13:58:29,060 WARN L192 SmtUtils]: Spent 12.13 s on a formula simplification. DAG size of input: 89 DAG size of output: 35 [2019-11-22 13:58:31,188 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-22 13:58:31,193 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 6=[|#memory_$Pointer$.offset|]} [2019-11-22 13:58:31,197 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 13:58:31,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:58:31,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:58:31,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:58:31,238 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-22 13:58:31,239 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 13:58:31,239 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:58:31,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:58:31,256 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 13:58:31,256 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:78, output treesize:21 [2019-11-22 13:58:31,303 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 13:58:31,303 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:58:31,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:58:31,728 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 13:58:31,756 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:58:31,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:58:31,861 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 13:58:31,869 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 13:58:31,984 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-22 13:58:31,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:58:31,987 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 13:58:31,988 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:148, output treesize:141 [2019-11-22 13:58:40,067 WARN L192 SmtUtils]: Spent 2.41 s on a formula simplification that was a NOOP. DAG size: 52 [2019-11-22 13:58:42,085 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4)) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse0 (store (select |c_#memory_$Pointer$.offset| .cse3) (bvadd .cse2 v_prenex_8 (_ bv3 32)) v_DerPreprocessor_3)) (.cse1 (bvadd .cse2 v_prenex_8))) (or (not (= (select .cse0 .cse1) v_DerPreprocessor_3)) (bvule (bvadd .cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse3 .cse0) c_create_data_~data~0.base) .cse4) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) .cse1 v_DerPreprocessor_1)) c_create_data_~data~0.base) .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 13:59:00,127 WARN L192 SmtUtils]: Spent 3.04 s on a formula simplification that was a NOOP. DAG size: 54 [2019-11-22 13:59:00,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:00,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:59:00,348 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 13:59:00,354 INFO L168 Benchmark]: Toolchain (without parser) took 197572.46 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.0 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -237.4 MB). Peak memory consumption was 85.5 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:00,354 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 13:59:00,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -142.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:00,355 INFO L168 Benchmark]: Boogie Preprocessor took 102.44 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 13:59:00,355 INFO L168 Benchmark]: RCFGBuilder took 1412.27 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: 90.6 MB). Peak memory consumption was 90.6 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:00,360 INFO L168 Benchmark]: TraceAbstraction took 195277.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -185.9 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:00,362 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.35 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 767.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -142.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 102.44 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 1412.27 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: 90.6 MB). Peak memory consumption was 90.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 195277.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -185.9 MB). Peak memory consumption was 2.8 MB. 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...