./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0232-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 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/test-0232-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ee3a23cf8ca0f6d04d9d74ad314377c3dff5fab ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-19 22:13:03,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:13:03,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:13:03,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:13:03,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:13:03,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:13:03,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:13:03,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:13:03,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:13:03,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:13:03,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:13:03,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:13:03,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:13:03,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:13:03,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:13:03,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:13:03,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:13:03,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:13:03,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:13:03,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:13:03,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:13:03,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:13:03,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:13:03,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:13:03,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:13:03,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:13:03,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:13:03,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:13:03,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:13:03,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:13:03,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:13:03,751 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:13:03,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:13:03,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:13:03,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:13:03,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:13:03,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:13:03,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:13:03,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:13:03,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:13:03,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:13:03,758 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-19 22:13:03,772 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:13:03,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:13:03,774 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:13:03,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:13:03,775 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:13:03,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:13:03,776 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:13:03,776 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:13:03,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:13:03,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:13:03,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:13:03,777 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-19 22:13:03,777 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-19 22:13:03,777 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-19 22:13:03,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:13:03,778 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 22:13:03,778 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 22:13:03,779 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:13:03,779 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:13:03,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:13:03,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:13:03,780 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:13:03,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:13:03,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:13:03,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:13:03,781 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:13:03,781 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 22:13:03,782 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 22:13:03,782 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 22:13:03,782 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ee3a23cf8ca0f6d04d9d74ad314377c3dff5fab [2019-11-19 22:13:04,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:13:04,091 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:13:04,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:13:04,097 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:13:04,099 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:13:04,100 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-1.i [2019-11-19 22:13:04,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40076f054/7fb790091af84d05974194d3db4430aa/FLAGe63871c85 [2019-11-19 22:13:04,751 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:13:04,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-1.i [2019-11-19 22:13:04,775 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40076f054/7fb790091af84d05974194d3db4430aa/FLAGe63871c85 [2019-11-19 22:13:05,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40076f054/7fb790091af84d05974194d3db4430aa [2019-11-19 22:13:05,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:13:05,100 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-19 22:13:05,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:13:05,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:13:05,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:13:05,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:13:05" (1/1) ... [2019-11-19 22:13:05,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b91ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:05, skipping insertion in model container [2019-11-19 22:13:05,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:13:05" (1/1) ... [2019-11-19 22:13:05,116 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:13:05,163 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:13:05,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:13:05,568 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:13:05,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:13:05,679 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:13:05,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:05 WrapperNode [2019-11-19 22:13:05,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:13:05,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:13:05,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:13:05,682 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:13:05,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:05" (1/1) ... [2019-11-19 22:13:05,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:05" (1/1) ... [2019-11-19 22:13:05,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:05" (1/1) ... [2019-11-19 22:13:05,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:05" (1/1) ... [2019-11-19 22:13:05,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:05" (1/1) ... [2019-11-19 22:13:05,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:05" (1/1) ... [2019-11-19 22:13:05,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:05" (1/1) ... [2019-11-19 22:13:05,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:13:05,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:13:05,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:13:05,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:13:05,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:05" (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-19 22:13:05,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-19 22:13:05,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:13:05,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-19 22:13:05,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-19 22:13:05,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-19 22:13:05,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-19 22:13:05,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-19 22:13:05,816 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-19 22:13:05,816 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-19 22:13:05,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-19 22:13:05,816 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-19 22:13:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-19 22:13:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-19 22:13:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-19 22:13:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-19 22:13:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-19 22:13:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-19 22:13:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-19 22:13:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-19 22:13:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-19 22:13:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-19 22:13:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-19 22:13:05,819 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-19 22:13:05,819 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-19 22:13:05,819 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-19 22:13:05,819 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-19 22:13:05,823 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-19 22:13:05,823 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-19 22:13:05,823 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-19 22:13:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-19 22:13:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-19 22:13:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-19 22:13:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-19 22:13:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-19 22:13:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-19 22:13:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-19 22:13:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-19 22:13:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-19 22:13:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-19 22:13:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-19 22:13:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-19 22:13:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-19 22:13:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-19 22:13:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-19 22:13:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-19 22:13:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-19 22:13:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-19 22:13:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-19 22:13:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-19 22:13:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-19 22:13:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-19 22:13:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-19 22:13:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-19 22:13:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-19 22:13:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-19 22:13:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-19 22:13:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-19 22:13:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-19 22:13:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-19 22:13:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-19 22:13:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-19 22:13:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-19 22:13:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-19 22:13:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-19 22:13:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-19 22:13:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-19 22:13:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-19 22:13:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-19 22:13:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-19 22:13:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-19 22:13:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-19 22:13:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-19 22:13:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-19 22:13:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-19 22:13:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-19 22:13:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-19 22:13:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-19 22:13:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-19 22:13:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-19 22:13:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-19 22:13:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-19 22:13:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-19 22:13:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-19 22:13:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-19 22:13:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-19 22:13:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-19 22:13:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-19 22:13:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-19 22:13:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-19 22:13:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-19 22:13:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-19 22:13:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-19 22:13:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-19 22:13:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-19 22:13:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-19 22:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-19 22:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-19 22:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-19 22:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-19 22:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-19 22:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-19 22:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-19 22:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-19 22:13:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-19 22:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-19 22:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-19 22:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-19 22:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-19 22:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-19 22:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-19 22:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-19 22:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-19 22:13:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-19 22:13:05,839 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-19 22:13:05,839 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-19 22:13:05,839 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-19 22:13:05,839 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-19 22:13:05,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-19 22:13:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-19 22:13:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 22:13:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 22:13:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 22:13:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-19 22:13:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:13:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-19 22:13:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:13:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-19 22:13:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:13:06,633 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:13:06,633 INFO L285 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-19 22:13:06,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:13:06 BoogieIcfgContainer [2019-11-19 22:13:06,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:13:06,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:13:06,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:13:06,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:13:06,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:13:05" (1/3) ... [2019-11-19 22:13:06,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614de563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:13:06, skipping insertion in model container [2019-11-19 22:13:06,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:05" (2/3) ... [2019-11-19 22:13:06,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614de563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:13:06, skipping insertion in model container [2019-11-19 22:13:06,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:13:06" (3/3) ... [2019-11-19 22:13:06,650 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2019-11-19 22:13:06,661 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:13:06,671 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2019-11-19 22:13:06,691 INFO L249 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2019-11-19 22:13:06,714 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:13:06,714 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-19 22:13:06,714 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:13:06,714 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:13:06,715 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:13:06,715 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:13:06,715 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:13:06,715 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:13:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-11-19 22:13:06,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-19 22:13:06,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:13:06,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:13:06,746 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 22:13:06,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:13:06,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1838646891, now seen corresponding path program 1 times [2019-11-19 22:13:06,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:13:06,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [603530539] [2019-11-19 22:13:06,763 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-19 22:13:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:13:06,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-19 22:13:06,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:13:06,998 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-19 22:13:06,998 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:13:07,020 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-19 22:13:07,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [603530539] [2019-11-19 22:13:07,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:13:07,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 22:13:07,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463010195] [2019-11-19 22:13:07,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 22:13:07,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:13:07,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 22:13:07,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 22:13:07,051 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 2 states. [2019-11-19 22:13:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:13:07,075 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-11-19 22:13:07,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 22:13:07,076 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-19 22:13:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:13:07,088 INFO L225 Difference]: With dead ends: 88 [2019-11-19 22:13:07,088 INFO L226 Difference]: Without dead ends: 85 [2019-11-19 22:13:07,090 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-19 22:13:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-19 22:13:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-19 22:13:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-19 22:13:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2019-11-19 22:13:07,140 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 8 [2019-11-19 22:13:07,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:13:07,141 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2019-11-19 22:13:07,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 22:13:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2019-11-19 22:13:07,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-19 22:13:07,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:13:07,142 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:13:07,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:07,346 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 22:13:07,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:13:07,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1163581944, now seen corresponding path program 1 times [2019-11-19 22:13:07,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:13:07,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [840044464] [2019-11-19 22:13:07,348 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-19 22:13:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:13:07,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 22:13:07,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:13:07,665 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-19 22:13:07,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:07,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:07,690 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-19 22:13:07,691 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:07,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:07,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:13:07,704 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-19 22:13:07,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:13:07,785 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-19 22:13:07,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:07,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:07,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:13:07,812 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 22:13:07,812 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:07,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:07,824 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-19 22:13:07,824 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-11-19 22:13:07,851 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-19 22:13:07,851 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:13:07,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:08,180 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-19 22:13:08,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [840044464] [2019-11-19 22:13:08,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:13:08,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-19 22:13:08,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025210032] [2019-11-19 22:13:08,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:13:08,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:13:08,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:13:08,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:13:08,185 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 8 states. [2019-11-19 22:13:12,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:13:12,461 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2019-11-19 22:13:12,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:13:12,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-19 22:13:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:13:12,467 INFO L225 Difference]: With dead ends: 103 [2019-11-19 22:13:12,468 INFO L226 Difference]: Without dead ends: 103 [2019-11-19 22:13:12,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:13:12,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-19 22:13:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2019-11-19 22:13:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-19 22:13:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2019-11-19 22:13:12,482 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 9 [2019-11-19 22:13:12,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:13:12,482 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2019-11-19 22:13:12,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:13:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2019-11-19 22:13:12,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-19 22:13:12,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:13:12,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:13:12,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:12,687 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 22:13:12,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:13:12,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1163581943, now seen corresponding path program 1 times [2019-11-19 22:13:12,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:13:12,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [350766898] [2019-11-19 22:13:12,689 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-19 22:13:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:13:12,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:13:12,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:13:12,898 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-19 22:13:12,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:12,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:12,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:13:12,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 22:13:12,951 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:12,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-19 22:13:12,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:12,978 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-19 22:13:12,979 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-19 22:13:12,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-19 22:13:12,996 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-19 22:13:12,999 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:13:13,068 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-19 22:13:13,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [350766898] [2019-11-19 22:13:13,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:13:13,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-19 22:13:13,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710553233] [2019-11-19 22:13:13,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:13:13,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:13:13,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:13:13,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:13:13,071 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 8 states. [2019-11-19 22:13:13,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:13:13,439 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-11-19 22:13:13,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:13:13,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-19 22:13:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:13:13,441 INFO L225 Difference]: With dead ends: 78 [2019-11-19 22:13:13,441 INFO L226 Difference]: Without dead ends: 78 [2019-11-19 22:13:13,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:13:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-19 22:13:13,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-19 22:13:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-19 22:13:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2019-11-19 22:13:13,450 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 9 [2019-11-19 22:13:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:13:13,450 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2019-11-19 22:13:13,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:13:13,451 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2019-11-19 22:13:13,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 22:13:13,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:13:13,452 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:13:13,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:13,656 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 22:13:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:13:13,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1711301932, now seen corresponding path program 1 times [2019-11-19 22:13:13,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:13:13,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1421632566] [2019-11-19 22:13:13,657 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-19 22:13:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:13:13,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:13:13,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:13:13,865 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-19 22:13:13,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:13,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:13,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:13:13,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 22:13:13,880 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-19 22:13:13,880 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:13:13,902 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-19 22:13:13,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1421632566] [2019-11-19 22:13:13,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:13:13,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-19 22:13:13,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881024118] [2019-11-19 22:13:13,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:13:13,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:13:13,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:13:13,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:13:13,905 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 4 states. [2019-11-19 22:13:14,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:13:14,079 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2019-11-19 22:13:14,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:13:14,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-19 22:13:14,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:13:14,085 INFO L225 Difference]: With dead ends: 74 [2019-11-19 22:13:14,085 INFO L226 Difference]: Without dead ends: 74 [2019-11-19 22:13:14,086 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-19 22:13:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-19 22:13:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-19 22:13:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-19 22:13:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-11-19 22:13:14,095 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 10 [2019-11-19 22:13:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:13:14,095 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-11-19 22:13:14,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:13:14,096 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-11-19 22:13:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 22:13:14,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:13:14,097 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:13:14,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:14,300 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 22:13:14,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:13:14,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1711301933, now seen corresponding path program 1 times [2019-11-19 22:13:14,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:13:14,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1481122501] [2019-11-19 22:13:14,303 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-19 22:13:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:13:14,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:13:14,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:13:14,488 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-19 22:13:14,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:14,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:14,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:13:14,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:13:14,505 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-19 22:13:14,505 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:13:14,546 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-19 22:13:14,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1481122501] [2019-11-19 22:13:14,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:13:14,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-19 22:13:14,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274922388] [2019-11-19 22:13:14,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:13:14,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:13:14,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:13:14,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:13:14,548 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 4 states. [2019-11-19 22:13:14,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:13:14,762 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-11-19 22:13:14,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:13:14,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-19 22:13:14,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:13:14,764 INFO L225 Difference]: With dead ends: 70 [2019-11-19 22:13:14,764 INFO L226 Difference]: Without dead ends: 70 [2019-11-19 22:13:14,764 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-19 22:13:14,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-19 22:13:14,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-19 22:13:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-19 22:13:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2019-11-19 22:13:14,771 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 10 [2019-11-19 22:13:14,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:13:14,771 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2019-11-19 22:13:14,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:13:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2019-11-19 22:13:14,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 22:13:14,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:13:14,772 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:13:14,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:14,974 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 22:13:14,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:13:14,975 INFO L82 PathProgramCache]: Analyzing trace with hash 42455267, now seen corresponding path program 1 times [2019-11-19 22:13:14,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:13:14,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1872651269] [2019-11-19 22:13:14,976 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-19 22:13:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:13:15,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 22:13:15,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:13:15,292 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-19 22:13:15,293 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-11-19 22:13:15,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:15,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:15,335 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-19 22:13:15,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-11-19 22:13:15,336 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:15,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:15,351 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-19 22:13:15,351 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2019-11-19 22:13:15,416 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:15,417 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-11-19 22:13:15,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:15,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:15,455 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:15,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-11-19 22:13:15,456 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:15,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:15,461 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-19 22:13:15,461 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2019-11-19 22:13:15,481 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-19 22:13:15,481 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:13:15,684 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-19 22:13:15,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1872651269] [2019-11-19 22:13:15,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:13:15,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-19 22:13:15,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723340121] [2019-11-19 22:13:15,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 22:13:15,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:13:15,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:13:15,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:13:15,688 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 13 states. [2019-11-19 22:13:15,969 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-11-19 22:13:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:13:16,673 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-11-19 22:13:16,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:13:16,674 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-11-19 22:13:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:13:16,675 INFO L225 Difference]: With dead ends: 82 [2019-11-19 22:13:16,675 INFO L226 Difference]: Without dead ends: 82 [2019-11-19 22:13:16,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-11-19 22:13:16,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-19 22:13:16,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2019-11-19 22:13:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-19 22:13:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-11-19 22:13:16,684 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 15 [2019-11-19 22:13:16,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:13:16,685 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-11-19 22:13:16,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 22:13:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-11-19 22:13:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:13:16,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:13:16,687 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:13:16,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:16,891 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 22:13:16,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:13:16,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1739337176, now seen corresponding path program 1 times [2019-11-19 22:13:16,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:13:16,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1751713958] [2019-11-19 22:13:16,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 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-19 22:13:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:13:17,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:13:17,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:13:17,171 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-19 22:13:17,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:17,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:17,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:13:17,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-19 22:13:17,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 22:13:17,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:17,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:17,213 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-19 22:13:17,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-19 22:13:17,248 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 11 [2019-11-19 22:13:17,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:17,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:17,251 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-19 22:13:17,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-11-19 22:13:17,262 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-19 22:13:17,262 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:13:17,385 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 32 treesize of output 28 [2019-11-19 22:13:17,387 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-19 22:13:17,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:17,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:13:17,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-11-19 22:13:17,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:17,517 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 10 treesize of output 8 [2019-11-19 22:13:17,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:17,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 22:13:17,525 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:17,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:17,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-19 22:13:17,535 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-11-19 22:13:17,546 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-19 22:13:17,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1751713958] [2019-11-19 22:13:17,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:13:17,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 9 [2019-11-19 22:13:17,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411667319] [2019-11-19 22:13:17,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:13:17,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:13:17,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:13:17,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:13:17,549 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 10 states. [2019-11-19 22:13:18,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:13:18,087 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2019-11-19 22:13:18,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:13:18,088 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-19 22:13:18,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:13:18,089 INFO L225 Difference]: With dead ends: 85 [2019-11-19 22:13:18,090 INFO L226 Difference]: Without dead ends: 85 [2019-11-19 22:13:18,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:13:18,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-19 22:13:18,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2019-11-19 22:13:18,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-19 22:13:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2019-11-19 22:13:18,098 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 23 [2019-11-19 22:13:18,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:13:18,100 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2019-11-19 22:13:18,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:13:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2019-11-19 22:13:18,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:13:18,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:13:18,102 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:13:18,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:18,305 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 22:13:18,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:13:18,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1739337175, now seen corresponding path program 1 times [2019-11-19 22:13:18,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:13:18,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1750648893] [2019-11-19 22:13:18,307 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-19 22:13:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:13:18,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 22:13:18,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:13:18,596 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 22:13:18,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:18,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:18,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 22:13:18,619 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:18,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:18,632 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-19 22:13:18,632 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2019-11-19 22:13:18,687 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-19 22:13:18,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:18,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:18,704 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-19 22:13:18,705 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:18,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:18,713 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-19 22:13:18,713 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-11-19 22:13:18,743 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-19 22:13:18,743 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:13:19,150 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 28 treesize of output 24 [2019-11-19 22:13:19,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-19 22:13:19,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:19,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:13:19,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:13:19,191 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:19,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:19,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:13:19,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:13:19,232 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:19,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:19,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:13:19,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:13:19,270 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:19,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:19,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-11-19 22:13:19,316 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:22 [2019-11-19 22:13:19,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:13:19,400 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 12 treesize of output 10 [2019-11-19 22:13:19,401 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-19 22:13:19,407 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 16 treesize of output 12 [2019-11-19 22:13:19,408 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:13:19,417 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 12 treesize of output 10 [2019-11-19 22:13:19,417 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-19 22:13:19,439 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 14 treesize of output 12 [2019-11-19 22:13:19,440 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-19 22:13:19,452 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 12 treesize of output 10 [2019-11-19 22:13:19,453 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:13:19,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:19,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2019-11-19 22:13:19,514 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:67, output treesize:55 [2019-11-19 22:13:19,738 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-11-19 22:13:19,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-19 22:13:19,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1750648893] [2019-11-19 22:13:19,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:13:19,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 12 [2019-11-19 22:13:19,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217489897] [2019-11-19 22:13:19,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 22:13:19,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:13:19,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:13:19,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:13:19,766 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 13 states. [2019-11-19 22:13:20,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:13:20,805 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2019-11-19 22:13:20,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:13:20,806 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-19 22:13:20,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:13:20,807 INFO L225 Difference]: With dead ends: 87 [2019-11-19 22:13:20,807 INFO L226 Difference]: Without dead ends: 87 [2019-11-19 22:13:20,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:13:20,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-19 22:13:20,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2019-11-19 22:13:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-19 22:13:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-11-19 22:13:20,813 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 23 [2019-11-19 22:13:20,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:13:20,814 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-11-19 22:13:20,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 22:13:20,814 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-11-19 22:13:20,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 22:13:20,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:13:20,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:13:21,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:21,019 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 22:13:21,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:13:21,020 INFO L82 PathProgramCache]: Analyzing trace with hash -740581632, now seen corresponding path program 1 times [2019-11-19 22:13:21,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:13:21,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1427909562] [2019-11-19 22:13:21,022 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-19 22:13:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:13:21,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:13:21,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:13:21,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 22:13:21,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:21,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:21,263 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-19 22:13:21,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-11-19 22:13:21,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-19 22:13:21,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:21,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:21,298 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-19 22:13:21,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-19 22:13:21,308 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-19 22:13:21,308 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:13:21,419 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 30 treesize of output 26 [2019-11-19 22:13:21,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-19 22:13:21,442 INFO L567 ElimStorePlain]: treesize reduction 9, result has 55.0 percent of original size [2019-11-19 22:13:21,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-19 22:13:21,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2019-11-19 22:13:21,450 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-19 22:13:21,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1427909562] [2019-11-19 22:13:21,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:13:21,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 8 [2019-11-19 22:13:21,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601669470] [2019-11-19 22:13:21,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:13:21,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:13:21,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:13:21,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:13:21,453 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 8 states. [2019-11-19 22:13:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:13:21,795 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-11-19 22:13:21,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:13:21,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-19 22:13:21,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:13:21,797 INFO L225 Difference]: With dead ends: 69 [2019-11-19 22:13:21,797 INFO L226 Difference]: Without dead ends: 69 [2019-11-19 22:13:21,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:13:21,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-19 22:13:21,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-19 22:13:21,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-19 22:13:21,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-11-19 22:13:21,803 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 25 [2019-11-19 22:13:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:13:21,803 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-11-19 22:13:21,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:13:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-11-19 22:13:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 22:13:21,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:13:21,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:13:22,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:22,006 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 22:13:22,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:13:22,006 INFO L82 PathProgramCache]: Analyzing trace with hash -2108347266, now seen corresponding path program 1 times [2019-11-19 22:13:22,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:13:22,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1478885725] [2019-11-19 22:13:22,007 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-19 22:13:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:13:22,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:13:22,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:13:22,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 22:13:22,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:22,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:22,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:13:22,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-19 22:13:22,272 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-19 22:13:22,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:22,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:22,277 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-19 22:13:22,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-19 22:13:22,286 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-19 22:13:22,286 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:13:22,377 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 28 treesize of output 24 [2019-11-19 22:13:22,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-19 22:13:22,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:22,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-19 22:13:22,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-11-19 22:13:22,397 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-19 22:13:22,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1478885725] [2019-11-19 22:13:22,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:13:22,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 7 [2019-11-19 22:13:22,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918835388] [2019-11-19 22:13:22,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:13:22,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:13:22,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:13:22,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:13:22,399 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 8 states. [2019-11-19 22:13:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:13:22,653 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-11-19 22:13:22,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:13:22,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-19 22:13:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:13:22,655 INFO L225 Difference]: With dead ends: 68 [2019-11-19 22:13:22,655 INFO L226 Difference]: Without dead ends: 68 [2019-11-19 22:13:22,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:13:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-19 22:13:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-19 22:13:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-19 22:13:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-11-19 22:13:22,659 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2019-11-19 22:13:22,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:13:22,660 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-11-19 22:13:22,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:13:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-11-19 22:13:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 22:13:22,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:13:22,661 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:13:22,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:22,861 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 22:13:22,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:13:22,862 INFO L82 PathProgramCache]: Analyzing trace with hash -934255735, now seen corresponding path program 1 times [2019-11-19 22:13:22,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:13:22,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1753100632] [2019-11-19 22:13:22,863 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-19 22:13:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:13:23,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 22:13:23,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:13:23,163 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 22:13:23,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:23,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:23,178 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-19 22:13:23,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2019-11-19 22:13:23,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:13:23,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:23,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:23,236 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-19 22:13:23,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-19 22:13:23,260 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-19 22:13:23,260 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:13:23,408 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 28 treesize of output 24 [2019-11-19 22:13:23,409 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-19 22:13:23,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:23,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:13:23,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:24 [2019-11-19 22:13:23,532 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-19 22:13:23,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1753100632] [2019-11-19 22:13:23,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:13:23,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 11 [2019-11-19 22:13:23,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066915667] [2019-11-19 22:13:23,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 22:13:23,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:13:23,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:13:23,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:13:23,534 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 12 states. [2019-11-19 22:13:24,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:13:24,037 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-19 22:13:24,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:13:24,038 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-19 22:13:24,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:13:24,039 INFO L225 Difference]: With dead ends: 67 [2019-11-19 22:13:24,039 INFO L226 Difference]: Without dead ends: 67 [2019-11-19 22:13:24,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:13:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-19 22:13:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-19 22:13:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-19 22:13:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-11-19 22:13:24,043 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 27 [2019-11-19 22:13:24,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:13:24,044 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-11-19 22:13:24,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 22:13:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-11-19 22:13:24,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 22:13:24,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:13:24,045 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:13:24,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:24,246 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 22:13:24,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:13:24,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1314824630, now seen corresponding path program 1 times [2019-11-19 22:13:24,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:13:24,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [526760029] [2019-11-19 22:13:24,247 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-19 22:13:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:13:24,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-19 22:13:24,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:13:24,567 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-19 22:13:24,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:24,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:24,592 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-19 22:13:24,592 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:24,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:24,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:13:24,607 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2019-11-19 22:13:24,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:13:24,638 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-19 22:13:24,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:24,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:24,670 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:24,671 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-19 22:13:24,672 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:24,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:24,689 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-19 22:13:24,689 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2019-11-19 22:13:24,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 22:13:24,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:24,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:24,803 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 22:13:24,803 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:24,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:24,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:13:24,822 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:43 [2019-11-19 22:13:24,949 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_145|], 3=[|v_#length_93|]} [2019-11-19 22:13:24,969 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:24,969 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-19 22:13:24,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:24,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:25,017 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:25,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 40 [2019-11-19 22:13:25,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:25,072 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-11-19 22:13:25,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:13:25,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:46 [2019-11-19 22:13:25,199 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-19 22:13:25,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-11-19 22:13:25,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:25,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:25,251 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-19 22:13:25,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-11-19 22:13:25,252 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:25,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:25,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:13:25,275 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:54 [2019-11-19 22:13:25,359 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:25,360 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2019-11-19 22:13:25,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:25,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:25,399 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:25,400 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-11-19 22:13:25,401 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:25,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:25,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:13:25,413 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:68, output treesize:20 [2019-11-19 22:13:25,467 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:13:25,467 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:13:25,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:26,855 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 38 treesize of output 34 [2019-11-19 22:13:26,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:26,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:26,956 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 72 treesize of output 68 [2019-11-19 22:13:26,957 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:13:27,087 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-19 22:13:27,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:27,107 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 46 treesize of output 38 [2019-11-19 22:13:27,109 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:27,236 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-19 22:13:27,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:27,250 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 108 treesize of output 100 [2019-11-19 22:13:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:27,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:27,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:27,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:27,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:27,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:27,256 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-19 22:13:27,509 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-19 22:13:27,510 INFO L567 ElimStorePlain]: treesize reduction 56, result has 60.3 percent of original size [2019-11-19 22:13:27,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:27,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:27,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:27,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-11-19 22:13:27,513 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:104, output treesize:85 [2019-11-19 22:13:27,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:27,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:27,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:27,813 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-19 22:13:27,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:27,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:27,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:28,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:28,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:28,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:28,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:28,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:28,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:28,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:28,088 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:28,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2019-11-19 22:13:28,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:28,118 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:28,118 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-19 22:13:28,119 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:28,149 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:28,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2019-11-19 22:13:28,150 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:28,179 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:28,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-19 22:13:28,180 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:28,214 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:28,215 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-11-19 22:13:28,215 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:28,246 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:28,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2019-11-19 22:13:28,247 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:28,525 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-11-19 22:13:28,525 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.2 percent of original size [2019-11-19 22:13:28,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2019-11-19 22:13:28,527 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:155, output treesize:69 [2019-11-19 22:13:28,979 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 24 [2019-11-19 22:13:28,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:13:29,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:29,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:29,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:29,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:29,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:29,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:29,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:29,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:29,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:30,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:30,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:30,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:13:30,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [526760029] [2019-11-19 22:13:30,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:13:30,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2019-11-19 22:13:30,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534591010] [2019-11-19 22:13:30,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-19 22:13:30,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:13:30,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-19 22:13:30,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-19 22:13:30,315 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 21 states. [2019-11-19 22:13:31,630 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 54 [2019-11-19 22:13:31,849 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-19 22:13:32,365 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 51 [2019-11-19 22:13:33,125 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-11-19 22:13:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:13:33,843 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-11-19 22:13:33,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 22:13:33,844 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-11-19 22:13:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:13:33,846 INFO L225 Difference]: With dead ends: 73 [2019-11-19 22:13:33,846 INFO L226 Difference]: Without dead ends: 73 [2019-11-19 22:13:33,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2019-11-19 22:13:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-19 22:13:33,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-11-19 22:13:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-19 22:13:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-11-19 22:13:33,851 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 28 [2019-11-19 22:13:33,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:13:33,851 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-11-19 22:13:33,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-19 22:13:33,852 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-11-19 22:13:33,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 22:13:33,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:13:33,853 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:13:34,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:34,057 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 22:13:34,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:13:34,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1314824631, now seen corresponding path program 1 times [2019-11-19 22:13:34,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:13:34,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1433831904] [2019-11-19 22:13:34,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:13:34,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-19 22:13:34,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:13:34,352 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-19 22:13:34,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:34,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:34,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:13:34,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-19 22:13:34,376 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 22:13:34,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:34,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:34,383 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-19 22:13:34,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-19 22:13:34,441 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:34,442 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 18 treesize of output 46 [2019-11-19 22:13:34,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:34,467 INFO L567 ElimStorePlain]: treesize reduction 26, result has 40.9 percent of original size [2019-11-19 22:13:34,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:13:34,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2019-11-19 22:13:34,525 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-19 22:13:34,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2019-11-19 22:13:34,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:34,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:34,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:13:34,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-11-19 22:13:34,605 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:34,605 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2019-11-19 22:13:34,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:34,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:34,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:13:34,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2019-11-19 22:13:34,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:13:34,647 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:13:34,947 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 32 treesize of output 28 [2019-11-19 22:13:34,948 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-19 22:13:34,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:34,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:13:34,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-11-19 22:13:35,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:35,160 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:35,160 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-19 22:13:35,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:35,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:35,174 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:35,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-19 22:13:35,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:35,176 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:35,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:35,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-19 22:13:35,196 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:7 [2019-11-19 22:13:35,202 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 10 treesize of output 8 [2019-11-19 22:13:35,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:35,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 22:13:35,206 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:35,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:35,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-19 22:13:35,211 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-11-19 22:13:35,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:13:35,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1433831904] [2019-11-19 22:13:35,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:13:35,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-11-19 22:13:35,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841710296] [2019-11-19 22:13:35,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-19 22:13:35,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:13:35,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-19 22:13:35,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:13:35,221 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 17 states. [2019-11-19 22:13:36,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:13:36,597 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-11-19 22:13:36,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 22:13:36,598 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-11-19 22:13:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:13:36,600 INFO L225 Difference]: With dead ends: 72 [2019-11-19 22:13:36,600 INFO L226 Difference]: Without dead ends: 72 [2019-11-19 22:13:36,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-11-19 22:13:36,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-19 22:13:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-11-19 22:13:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-19 22:13:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-11-19 22:13:36,604 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 28 [2019-11-19 22:13:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:13:36,605 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-11-19 22:13:36,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-19 22:13:36,605 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-11-19 22:13:36,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 22:13:36,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:13:36,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:13:36,809 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:36,810 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 22:13:36,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:13:36,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1102843360, now seen corresponding path program 1 times [2019-11-19 22:13:36,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:13:36,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1528721154] [2019-11-19 22:13:36,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:13:37,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:13:37,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:13:37,057 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-19 22:13:37,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:37,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:37,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:13:37,063 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-19 22:13:37,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 22:13:37,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:37,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:37,096 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-19 22:13:37,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-19 22:13:37,121 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-19 22:13:37,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:37,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:37,129 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-19 22:13:37,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-19 22:13:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:13:37,144 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:13:37,250 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 32 treesize of output 28 [2019-11-19 22:13:37,251 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-19 22:13:37,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:37,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:13:37,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-11-19 22:13:37,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:13:37,364 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 10 treesize of output 8 [2019-11-19 22:13:37,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:37,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 22:13:37,378 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:37,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:37,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-19 22:13:37,385 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-11-19 22:13:37,398 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-19 22:13:37,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1528721154] [2019-11-19 22:13:37,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:13:37,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 9 [2019-11-19 22:13:37,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146084215] [2019-11-19 22:13:37,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:13:37,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:13:37,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:13:37,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:13:37,399 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 10 states. [2019-11-19 22:13:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:13:37,801 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-11-19 22:13:37,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:13:37,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-11-19 22:13:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:13:37,804 INFO L225 Difference]: With dead ends: 69 [2019-11-19 22:13:37,804 INFO L226 Difference]: Without dead ends: 69 [2019-11-19 22:13:37,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:13:37,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-19 22:13:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-19 22:13:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-19 22:13:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-11-19 22:13:37,808 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 28 [2019-11-19 22:13:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:13:37,808 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-11-19 22:13:37,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:13:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-11-19 22:13:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 22:13:37,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:13:37,809 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:13:38,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:38,013 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 22:13:38,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:13:38,013 INFO L82 PathProgramCache]: Analyzing trace with hash -171594132, now seen corresponding path program 1 times [2019-11-19 22:13:38,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:13:38,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [104419863] [2019-11-19 22:13:38,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:13:38,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 22:13:38,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:13:38,297 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-19 22:13:38,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:38,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:13:38,358 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-19 22:13:38,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:38,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2019-11-19 22:13:38,373 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 22:13:38,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:38,381 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-19 22:13:38,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-19 22:13:38,411 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:38,412 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-19 22:13:38,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:38,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-19 22:13:38,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-19 22:13:38,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:38,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2019-11-19 22:13:38,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-19 22:13:38,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,484 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-19 22:13:38,485 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-19 22:13:38,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-11-19 22:13:38,505 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-19 22:13:38,506 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:13:38,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:38,714 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 8 treesize of output 6 [2019-11-19 22:13:38,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:38,729 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 6 treesize of output 4 [2019-11-19 22:13:38,729 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:38,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,732 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-19 22:13:38,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:38,797 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 31 treesize of output 29 [2019-11-19 22:13:38,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,814 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:38,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2019-11-19 22:13:38,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:13:38,816 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:38,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:13:38,854 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 31 treesize of output 27 [2019-11-19 22:13:38,855 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,910 INFO L567 ElimStorePlain]: treesize reduction 5, result has 85.7 percent of original size [2019-11-19 22:13:38,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-19 22:13:38,911 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:54, output treesize:30 [2019-11-19 22:13:38,969 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 19 treesize of output 17 [2019-11-19 22:13:38,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,974 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-11-19 22:13:38,975 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:38,979 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 18 treesize of output 16 [2019-11-19 22:13:38,980 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:13:39,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:13:39,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-11-19 22:13:39,002 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:56, output treesize:38 [2019-11-19 22:13:39,061 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-19 22:13:39,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [104419863] [2019-11-19 22:13:39,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:13:39,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-19 22:13:39,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165396727] [2019-11-19 22:13:39,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 22:13:39,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:13:39,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 22:13:39,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:13:39,063 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 14 states. [2019-11-19 22:13:43,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:13:43,831 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2019-11-19 22:13:43,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 22:13:43,832 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-11-19 22:13:43,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:13:43,834 INFO L225 Difference]: With dead ends: 86 [2019-11-19 22:13:43,834 INFO L226 Difference]: Without dead ends: 86 [2019-11-19 22:13:43,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-11-19 22:13:43,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-19 22:13:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2019-11-19 22:13:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-19 22:13:43,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-11-19 22:13:43,838 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 29 [2019-11-19 22:13:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:13:43,838 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-11-19 22:13:43,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 22:13:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-11-19 22:13:43,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 22:13:43,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:13:43,841 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:13:44,044 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:44,045 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 22:13:44,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:13:44,045 INFO L82 PathProgramCache]: Analyzing trace with hash -171594131, now seen corresponding path program 1 times [2019-11-19 22:13:44,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:13:44,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [991457269] [2019-11-19 22:13:44,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:13:44,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:13:44,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:13:44,244 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-19 22:13:44,244 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:13:44,253 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-19 22:13:44,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [991457269] [2019-11-19 22:13:44,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:13:44,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 22:13:44,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842740123] [2019-11-19 22:13:44,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:13:44,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:13:44,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:13:44,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:13:44,255 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 3 states. [2019-11-19 22:13:44,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:13:44,375 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-11-19 22:13:44,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:13:44,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-19 22:13:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:13:44,378 INFO L225 Difference]: With dead ends: 63 [2019-11-19 22:13:44,378 INFO L226 Difference]: Without dead ends: 63 [2019-11-19 22:13:44,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:13:44,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-19 22:13:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-19 22:13:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-19 22:13:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-11-19 22:13:44,381 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 29 [2019-11-19 22:13:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:13:44,382 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-11-19 22:13:44,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:13:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-11-19 22:13:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 22:13:44,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:13:44,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:13:44,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:44,594 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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, appendErr4REQUIRES_VIOLATION]=== [2019-11-19 22:13:44,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:13:44,595 INFO L82 PathProgramCache]: Analyzing trace with hash 624655538, now seen corresponding path program 1 times [2019-11-19 22:13:44,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:13:44,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1492718616] [2019-11-19 22:13:44,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:13:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:13:45,154 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-19 22:13:45,154 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 22:13:45,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:13:45,382 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-19 22:13:45,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:13:45 BoogieIcfgContainer [2019-11-19 22:13:45,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:13:45,411 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:13:45,411 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:13:45,412 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:13:45,412 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:13:06" (3/4) ... [2019-11-19 22:13:45,415 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 22:13:45,415 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:13:45,416 INFO L168 Benchmark]: Toolchain (without parser) took 40316.73 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.7 MB). Free memory was 957.7 MB in the beginning and 829.0 MB in the end (delta: 128.7 MB). Peak memory consumption was 456.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:13:45,417 INFO L168 Benchmark]: CDTParser took 0.87 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-19 22:13:45,417 INFO L168 Benchmark]: CACSL2BoogieTranslator took 579.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -156.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-19 22:13:45,417 INFO L168 Benchmark]: Boogie Preprocessor took 74.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 22:13:45,418 INFO L168 Benchmark]: RCFGBuilder took 882.70 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: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:13:45,418 INFO L168 Benchmark]: TraceAbstraction took 38770.55 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.3 MB). Free memory was 1.0 GB in the beginning and 829.0 MB in the end (delta: 220.8 MB). Peak memory consumption was 411.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:13:45,418 INFO L168 Benchmark]: Witness Printer took 4.23 ms. Allocated memory is still 1.4 GB. Free memory is still 829.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:13:45,420 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.87 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 579.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -156.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 882.70 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: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38770.55 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.3 MB). Free memory was 1.0 GB in the beginning and 829.0 MB in the end (delta: 220.8 MB). Peak memory consumption was 411.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.23 ms. Allocated memory is still 1.4 GB. Free memory is still 829.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 526]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 526. Possible FailurePath: [L528] struct item *list = ((void *)0); VAL [list={1877082112:0}] [L530] CALL append(&list) VAL [plist={1877082112:0}] [L519] struct item *item = malloc(sizeof *item); VAL [item={270464763:0}, malloc(sizeof *item)={270464763:0}, plist={1877082112:0}, plist={1877082112:0}] [L520] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={270464763:0}, malloc(sizeof *item)={270464763:0}, plist={1877082112:0}, plist={1877082112:0}] [L520] item->next = *plist VAL [\read(**plist)={0:0}, item={270464763:0}, malloc(sizeof *item)={270464763:0}, plist={1877082112:0}, plist={1877082112:0}] [L521] EXPR item->next VAL [item={270464763:0}, item->next={0:0}, malloc(sizeof *item)={270464763:0}, plist={1877082112:0}, plist={1877082112:0}] [L521-L523] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L521-L523] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1343094784:0}, item={270464763:0}, item->next={0:0}, malloc(sizeof *item)={270464763:0}, malloc(sizeof *item)={-1343094784:0}, plist={1877082112:0}, plist={1877082112:0}] [L521-L523] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1343094784:0}, item={270464763:0}, item->next={0:0}, malloc(sizeof *item)={270464763:0}, malloc(sizeof *item)={-1343094784:0}, plist={1877082112:0}, plist={1877082112:0}] [L524] *plist = item VAL [item={270464763:0}, malloc(sizeof *item)={270464763:0}, malloc(sizeof *item)={-1343094784:0}, plist={1877082112:0}, plist={1877082112:0}] [L530] RET append(&list) VAL [list={1877082112:0}] [L531] COND FALSE !(__VERIFIER_nondet_int()) [L532] \read(*list) VAL [\read(*list)={270464763:0}, list={1877082112:0}] [L532] COND TRUE \read(*list) [L533] EXPR \read(*list) VAL [\read(*list)={270464763:0}, list={1877082112:0}] [L533] EXPR list->next VAL [\read(*list)={270464763:0}, list={1877082112:0}, list->next={0:0}] [L533] struct item *next = list->next; [L534] EXPR \read(*list) VAL [\read(*list)={270464763:0}, list={1877082112:0}, next={0:0}] [L534] free(list) VAL [\read(*list)={270464763:0}, list={1877082112:0}, next={0:0}] [L534] free(list) VAL [\read(*list)={270464763:0}, list={1877082112:0}, next={0:0}] [L534] free(list) [L535] list = next VAL [list={1877082112:0}, next={0:0}] [L537] \read(*list) VAL [\read(*list)={0:0}, list={1877082112:0}, next={0:0}] [L537] COND FALSE !(\read(*list)) [L542] return 0; [L528] struct item *list = ((void *)0); [L542] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 103 locations, 41 error locations. Result: UNSAFE, OverallTime: 38.6s, OverallIterations: 17, TraceHistogramMax: 2, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 709 SDtfs, 1177 SDslu, 2339 SDs, 0 SdLazy, 3048 SolverSat, 184 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 683 GetRequests, 499 SyntacticMatches, 16 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 68 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 622 ConstructedInterpolants, 56 QuantifiedInterpolants, 157007 SizeOfPredicates, 162 NumberOfNonLiveVariables, 1600 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 32 InterpolantComputations, 28 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...