./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/test-0232_1-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 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 05:58:44,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 05:58:44,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 05:58:44,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 05:58:44,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 05:58:44,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 05:58:44,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 05:58:44,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 05:58:44,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 05:58:44,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 05:58:44,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 05:58:44,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 05:58:44,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 05:58:44,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 05:58:44,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 05:58:44,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 05:58:44,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 05:58:44,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 05:58:44,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 05:58:44,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 05:58:44,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 05:58:44,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 05:58:44,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 05:58:44,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 05:58:44,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 05:58:44,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 05:58:44,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 05:58:44,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 05:58:44,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 05:58:44,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 05:58:44,732 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 05:58:44,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 05:58:44,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 05:58:44,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 05:58:44,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 05:58:44,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 05:58:44,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 05:58:44,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 05:58:44,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 05:58:44,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 05:58:44,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 05:58:44,750 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-10-20 05:58:44,797 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 05:58:44,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 05:58:44,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 05:58:44,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 05:58:44,799 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 05:58:44,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 05:58:44,800 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 05:58:44,800 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 05:58:44,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 05:58:44,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 05:58:44,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 05:58:44,802 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-10-20 05:58:44,802 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-10-20 05:58:44,802 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-10-20 05:58:44,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 05:58:44,803 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-10-20 05:58:44,803 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 05:58:44,803 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 05:58:44,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 05:58:44,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 05:58:44,804 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 05:58:44,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 05:58:44,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 05:58:44,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 05:58:44,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 05:58:44,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 05:58:44,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 05:58:44,805 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 05:58:44,805 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 [2020-10-20 05:58:45,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 05:58:45,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 05:58:45,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 05:58:45,027 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 05:58:45,028 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 05:58:45,028 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2020-10-20 05:58:45,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2b5b9e36/0e0015dfb28046248d9610b48791ee66/FLAGacce1a666 [2020-10-20 05:58:45,646 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 05:58:45,647 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2020-10-20 05:58:45,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2b5b9e36/0e0015dfb28046248d9610b48791ee66/FLAGacce1a666 [2020-10-20 05:58:45,958 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2b5b9e36/0e0015dfb28046248d9610b48791ee66 [2020-10-20 05:58:45,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 05:58:45,968 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-20 05:58:45,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 05:58:45,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 05:58:45,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 05:58:45,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:58:45" (1/1) ... [2020-10-20 05:58:45,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59e69e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:58:45, skipping insertion in model container [2020-10-20 05:58:45,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:58:45" (1/1) ... [2020-10-20 05:58:45,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 05:58:46,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 05:58:46,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 05:58:46,525 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 05:58:46,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 05:58:46,676 INFO L208 MainTranslator]: Completed translation [2020-10-20 05:58:46,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:58:46 WrapperNode [2020-10-20 05:58:46,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 05:58:46,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 05:58:46,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 05:58:46,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 05:58:46,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:58:46" (1/1) ... [2020-10-20 05:58:46,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:58:46" (1/1) ... [2020-10-20 05:58:46,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:58:46" (1/1) ... [2020-10-20 05:58:46,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:58:46" (1/1) ... [2020-10-20 05:58:46,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:58:46" (1/1) ... [2020-10-20 05:58:46,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:58:46" (1/1) ... [2020-10-20 05:58:46,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:58:46" (1/1) ... [2020-10-20 05:58:46,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 05:58:46,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 05:58:46,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 05:58:46,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 05:58:46,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:58:46" (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 [2020-10-20 05:58:46,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-20 05:58:46,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 05:58:46,885 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-20 05:58:46,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-10-20 05:58:46,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-10-20 05:58:46,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-10-20 05:58:46,887 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-10-20 05:58:46,887 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-10-20 05:58:46,887 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2020-10-20 05:58:46,887 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-20 05:58:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-20 05:58:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-20 05:58:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-20 05:58:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-20 05:58:46,889 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-20 05:58:46,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 05:58:46,891 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-10-20 05:58:46,892 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-10-20 05:58:46,892 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-10-20 05:58:46,892 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-10-20 05:58:46,892 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-10-20 05:58:46,892 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-10-20 05:58:46,893 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-10-20 05:58:46,893 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-10-20 05:58:46,893 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-10-20 05:58:46,893 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-10-20 05:58:46,894 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-10-20 05:58:46,894 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-10-20 05:58:46,894 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-10-20 05:58:46,894 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-10-20 05:58:46,894 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-10-20 05:58:46,895 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-10-20 05:58:46,895 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-10-20 05:58:46,895 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-10-20 05:58:46,895 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-10-20 05:58:46,895 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-10-20 05:58:46,895 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-10-20 05:58:46,895 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-10-20 05:58:46,895 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-10-20 05:58:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-10-20 05:58:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-10-20 05:58:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-10-20 05:58:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-10-20 05:58:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-10-20 05:58:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-10-20 05:58:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-10-20 05:58:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-10-20 05:58:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-10-20 05:58:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-10-20 05:58:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-10-20 05:58:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-10-20 05:58:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-10-20 05:58:46,899 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-10-20 05:58:46,899 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-10-20 05:58:46,899 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-10-20 05:58:46,899 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-10-20 05:58:46,899 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-10-20 05:58:46,900 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-10-20 05:58:46,900 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-10-20 05:58:46,900 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-10-20 05:58:46,900 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-10-20 05:58:46,900 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-10-20 05:58:46,901 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-10-20 05:58:46,901 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-10-20 05:58:46,901 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-10-20 05:58:46,901 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-10-20 05:58:46,902 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-10-20 05:58:46,902 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-10-20 05:58:46,902 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-10-20 05:58:46,902 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-10-20 05:58:46,902 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-10-20 05:58:46,903 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-20 05:58:46,903 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-20 05:58:46,903 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-20 05:58:46,904 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-20 05:58:46,904 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-10-20 05:58:46,905 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-20 05:58:46,905 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-10-20 05:58:46,905 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-10-20 05:58:46,905 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-10-20 05:58:46,906 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-10-20 05:58:46,906 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-10-20 05:58:46,906 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-20 05:58:46,906 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-10-20 05:58:46,906 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-10-20 05:58:46,906 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-10-20 05:58:46,906 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-10-20 05:58:46,906 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-10-20 05:58:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-10-20 05:58:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-10-20 05:58:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-10-20 05:58:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-10-20 05:58:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-10-20 05:58:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-10-20 05:58:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-10-20 05:58:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-10-20 05:58:46,908 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-10-20 05:58:46,908 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-10-20 05:58:46,908 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-10-20 05:58:46,908 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-10-20 05:58:46,908 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-10-20 05:58:46,908 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-10-20 05:58:46,908 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-10-20 05:58:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-10-20 05:58:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-10-20 05:58:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-10-20 05:58:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-10-20 05:58:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-10-20 05:58:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-10-20 05:58:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-10-20 05:58:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-10-20 05:58:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-10-20 05:58:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-10-20 05:58:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-10-20 05:58:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-10-20 05:58:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-10-20 05:58:46,911 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-10-20 05:58:46,911 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-10-20 05:58:46,911 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-10-20 05:58:46,911 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-10-20 05:58:46,911 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-10-20 05:58:46,912 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-10-20 05:58:46,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-20 05:58:46,912 INFO L130 BoogieDeclarations]: Found specification of procedure append [2020-10-20 05:58:46,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 05:58:46,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 05:58:46,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 05:58:46,912 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-20 05:58:46,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-10-20 05:58:46,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 05:58:46,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-20 05:58:46,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 05:58:46,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 05:58:46,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 05:58:46,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 05:58:47,613 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 05:58:47,614 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-10-20 05:58:47,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:58:47 BoogieIcfgContainer [2020-10-20 05:58:47,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 05:58:47,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 05:58:47,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 05:58:47,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 05:58:47,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 05:58:45" (1/3) ... [2020-10-20 05:58:47,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7176726d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:58:47, skipping insertion in model container [2020-10-20 05:58:47,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:58:46" (2/3) ... [2020-10-20 05:58:47,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7176726d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:58:47, skipping insertion in model container [2020-10-20 05:58:47,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:58:47" (3/3) ... [2020-10-20 05:58:47,626 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2020-10-20 05:58:47,638 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 05:58:47,646 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2020-10-20 05:58:47,656 INFO L253 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2020-10-20 05:58:47,673 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 05:58:47,673 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-20 05:58:47,673 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 05:58:47,673 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 05:58:47,674 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 05:58:47,674 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 05:58:47,674 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 05:58:47,674 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 05:58:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2020-10-20 05:58:47,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 05:58:47,702 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:58:47,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:58:47,704 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:58:47,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:58:47,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1863992736, now seen corresponding path program 1 times [2020-10-20 05:58:47,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:58:47,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731088853] [2020-10-20 05:58:47,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:58:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:48,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:58:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:48,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:58:48,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731088853] [2020-10-20 05:58:48,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:58:48,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 05:58:48,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143725428] [2020-10-20 05:58:48,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:58:48,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:58:48,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:58:48,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:58:48,073 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 6 states. [2020-10-20 05:58:48,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:58:48,494 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2020-10-20 05:58:48,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 05:58:48,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-20 05:58:48,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:58:48,508 INFO L225 Difference]: With dead ends: 95 [2020-10-20 05:58:48,508 INFO L226 Difference]: Without dead ends: 92 [2020-10-20 05:58:48,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:58:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-20 05:58:48,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2020-10-20 05:58:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-20 05:58:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2020-10-20 05:58:48,558 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 9 [2020-10-20 05:58:48,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:58:48,559 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2020-10-20 05:58:48,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:58:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2020-10-20 05:58:48,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 05:58:48,560 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:58:48,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:58:48,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 05:58:48,561 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:58:48,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:58:48,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1863992737, now seen corresponding path program 1 times [2020-10-20 05:58:48,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:58:48,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984367305] [2020-10-20 05:58:48,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:58:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:48,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:58:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:48,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:58:48,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984367305] [2020-10-20 05:58:48,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:58:48,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 05:58:48,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030669607] [2020-10-20 05:58:48,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:58:48,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:58:48,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:58:48,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:58:48,728 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 6 states. [2020-10-20 05:58:49,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:58:49,136 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2020-10-20 05:58:49,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:58:49,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-20 05:58:49,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:58:49,142 INFO L225 Difference]: With dead ends: 121 [2020-10-20 05:58:49,143 INFO L226 Difference]: Without dead ends: 121 [2020-10-20 05:58:49,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:58:49,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-10-20 05:58:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 100. [2020-10-20 05:58:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-20 05:58:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2020-10-20 05:58:49,168 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 9 [2020-10-20 05:58:49,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:58:49,169 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2020-10-20 05:58:49,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:58:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2020-10-20 05:58:49,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 05:58:49,170 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:58:49,170 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:58:49,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 05:58:49,174 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:58:49,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:58:49,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1949200060, now seen corresponding path program 1 times [2020-10-20 05:58:49,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:58:49,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58823246] [2020-10-20 05:58:49,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:58:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:49,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:58:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:58:49,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58823246] [2020-10-20 05:58:49,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:58:49,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 05:58:49,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893269931] [2020-10-20 05:58:49,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 05:58:49,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:58:49,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 05:58:49,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 05:58:49,268 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 4 states. [2020-10-20 05:58:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:58:49,441 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2020-10-20 05:58:49,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 05:58:49,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-20 05:58:49,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:58:49,442 INFO L225 Difference]: With dead ends: 96 [2020-10-20 05:58:49,442 INFO L226 Difference]: Without dead ends: 96 [2020-10-20 05:58:49,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 05:58:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-10-20 05:58:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2020-10-20 05:58:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-20 05:58:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2020-10-20 05:58:49,450 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 10 [2020-10-20 05:58:49,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:58:49,451 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2020-10-20 05:58:49,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 05:58:49,451 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2020-10-20 05:58:49,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 05:58:49,452 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:58:49,452 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:58:49,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 05:58:49,452 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:58:49,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:58:49,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1949200061, now seen corresponding path program 1 times [2020-10-20 05:58:49,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:58:49,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790990949] [2020-10-20 05:58:49,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:58:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:49,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:58:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:58:49,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790990949] [2020-10-20 05:58:49,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:58:49,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 05:58:49,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814006222] [2020-10-20 05:58:49,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 05:58:49,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:58:49,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 05:58:49,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 05:58:49,519 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 4 states. [2020-10-20 05:58:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:58:49,698 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2020-10-20 05:58:49,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 05:58:49,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-20 05:58:49,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:58:49,700 INFO L225 Difference]: With dead ends: 92 [2020-10-20 05:58:49,700 INFO L226 Difference]: Without dead ends: 92 [2020-10-20 05:58:49,701 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 05:58:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-20 05:58:49,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-20 05:58:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-20 05:58:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2020-10-20 05:58:49,708 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 10 [2020-10-20 05:58:49,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:58:49,708 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2020-10-20 05:58:49,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 05:58:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2020-10-20 05:58:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 05:58:49,709 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:58:49,709 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:58:49,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 05:58:49,710 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:58:49,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:58:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash -203601109, now seen corresponding path program 1 times [2020-10-20 05:58:49,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:58:49,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917535172] [2020-10-20 05:58:49,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:58:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:49,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:58:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:58:49,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917535172] [2020-10-20 05:58:49,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:58:49,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 05:58:49,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520168236] [2020-10-20 05:58:49,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 05:58:49,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:58:49,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 05:58:49,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:58:49,838 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 9 states. [2020-10-20 05:58:50,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:58:50,222 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2020-10-20 05:58:50,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 05:58:50,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-20 05:58:50,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:58:50,224 INFO L225 Difference]: With dead ends: 103 [2020-10-20 05:58:50,224 INFO L226 Difference]: Without dead ends: 103 [2020-10-20 05:58:50,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-20 05:58:50,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-20 05:58:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2020-10-20 05:58:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-20 05:58:50,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2020-10-20 05:58:50,233 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 15 [2020-10-20 05:58:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:58:50,234 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2020-10-20 05:58:50,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 05:58:50,234 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2020-10-20 05:58:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 05:58:50,235 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:58:50,235 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:58:50,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 05:58:50,235 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:58:50,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:58:50,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2016388927, now seen corresponding path program 1 times [2020-10-20 05:58:50,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:58:50,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251840690] [2020-10-20 05:58:50,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:58:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:50,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:58:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:58:50,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251840690] [2020-10-20 05:58:50,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:58:50,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 05:58:50,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923399115] [2020-10-20 05:58:50,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:58:50,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:58:50,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:58:50,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:58:50,355 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 8 states. [2020-10-20 05:58:50,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:58:50,604 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2020-10-20 05:58:50,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:58:50,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-20 05:58:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:58:50,606 INFO L225 Difference]: With dead ends: 98 [2020-10-20 05:58:50,606 INFO L226 Difference]: Without dead ends: 98 [2020-10-20 05:58:50,607 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-20 05:58:50,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-20 05:58:50,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2020-10-20 05:58:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-20 05:58:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2020-10-20 05:58:50,614 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 16 [2020-10-20 05:58:50,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:58:50,614 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2020-10-20 05:58:50,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:58:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2020-10-20 05:58:50,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 05:58:50,616 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:58:50,616 INFO L422 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] [2020-10-20 05:58:50,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 05:58:50,616 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:58:50,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:58:50,617 INFO L82 PathProgramCache]: Analyzing trace with hash 198096205, now seen corresponding path program 1 times [2020-10-20 05:58:50,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:58:50,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685705734] [2020-10-20 05:58:50,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:58:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:50,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:58:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:50,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:58:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:50,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:58:50,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685705734] [2020-10-20 05:58:50,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:58:50,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 05:58:50,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280336463] [2020-10-20 05:58:50,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 05:58:50,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:58:50,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 05:58:50,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:58:50,780 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand 9 states. [2020-10-20 05:58:51,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:58:51,176 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2020-10-20 05:58:51,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 05:58:51,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-20 05:58:51,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:58:51,179 INFO L225 Difference]: With dead ends: 111 [2020-10-20 05:58:51,180 INFO L226 Difference]: Without dead ends: 111 [2020-10-20 05:58:51,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-20 05:58:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-20 05:58:51,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2020-10-20 05:58:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-20 05:58:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2020-10-20 05:58:51,188 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 25 [2020-10-20 05:58:51,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:58:51,193 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2020-10-20 05:58:51,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 05:58:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2020-10-20 05:58:51,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 05:58:51,195 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:58:51,195 INFO L422 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] [2020-10-20 05:58:51,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 05:58:51,196 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:58:51,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:58:51,196 INFO L82 PathProgramCache]: Analyzing trace with hash 198096206, now seen corresponding path program 1 times [2020-10-20 05:58:51,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:58:51,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758062192] [2020-10-20 05:58:51,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:58:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:51,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:58:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:51,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:58:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:58:51,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758062192] [2020-10-20 05:58:51,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:58:51,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 05:58:51,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806470358] [2020-10-20 05:58:51,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 05:58:51,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:58:51,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 05:58:51,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:58:51,502 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 9 states. [2020-10-20 05:58:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:58:51,887 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2020-10-20 05:58:51,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 05:58:51,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-20 05:58:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:58:51,889 INFO L225 Difference]: With dead ends: 106 [2020-10-20 05:58:51,890 INFO L226 Difference]: Without dead ends: 106 [2020-10-20 05:58:51,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-20 05:58:51,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-20 05:58:51,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2020-10-20 05:58:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-20 05:58:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2020-10-20 05:58:51,902 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 25 [2020-10-20 05:58:51,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:58:51,902 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2020-10-20 05:58:51,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 05:58:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2020-10-20 05:58:51,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 05:58:51,905 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:58:51,905 INFO L422 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] [2020-10-20 05:58:51,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 05:58:51,906 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:58:51,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:58:51,906 INFO L82 PathProgramCache]: Analyzing trace with hash 198082271, now seen corresponding path program 1 times [2020-10-20 05:58:51,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:58:51,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938180383] [2020-10-20 05:58:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:58:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:51,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:58:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:51,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:58:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:58:52,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938180383] [2020-10-20 05:58:52,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:58:52,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 05:58:52,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870962746] [2020-10-20 05:58:52,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 05:58:52,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:58:52,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 05:58:52,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 05:58:52,024 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 5 states. [2020-10-20 05:58:52,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:58:52,176 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2020-10-20 05:58:52,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 05:58:52,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-10-20 05:58:52,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:58:52,178 INFO L225 Difference]: With dead ends: 76 [2020-10-20 05:58:52,180 INFO L226 Difference]: Without dead ends: 76 [2020-10-20 05:58:52,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:58:52,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-20 05:58:52,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-10-20 05:58:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-20 05:58:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2020-10-20 05:58:52,185 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 25 [2020-10-20 05:58:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:58:52,185 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2020-10-20 05:58:52,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 05:58:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2020-10-20 05:58:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 05:58:52,187 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:58:52,187 INFO L422 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] [2020-10-20 05:58:52,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 05:58:52,187 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:58:52,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:58:52,188 INFO L82 PathProgramCache]: Analyzing trace with hash 199318401, now seen corresponding path program 1 times [2020-10-20 05:58:52,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:58:52,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141786790] [2020-10-20 05:58:52,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:58:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:52,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:58:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:52,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:58:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:58:52,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141786790] [2020-10-20 05:58:52,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:58:52,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 05:58:52,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570347085] [2020-10-20 05:58:52,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:58:52,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:58:52,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:58:52,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:58:52,267 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 6 states. [2020-10-20 05:58:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:58:52,443 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2020-10-20 05:58:52,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 05:58:52,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-20 05:58:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:58:52,444 INFO L225 Difference]: With dead ends: 72 [2020-10-20 05:58:52,445 INFO L226 Difference]: Without dead ends: 72 [2020-10-20 05:58:52,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-20 05:58:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-20 05:58:52,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2020-10-20 05:58:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-20 05:58:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2020-10-20 05:58:52,448 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2020-10-20 05:58:52,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:58:52,449 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2020-10-20 05:58:52,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:58:52,449 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2020-10-20 05:58:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-20 05:58:52,450 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:58:52,450 INFO L422 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] [2020-10-20 05:58:52,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 05:58:52,450 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:58:52,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:58:52,451 INFO L82 PathProgramCache]: Analyzing trace with hash 199008275, now seen corresponding path program 1 times [2020-10-20 05:58:52,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:58:52,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645896368] [2020-10-20 05:58:52,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:58:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:52,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:58:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:52,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:58:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:58:52,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645896368] [2020-10-20 05:58:52,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:58:52,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 05:58:52,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624614579] [2020-10-20 05:58:52,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:58:52,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:58:52,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:58:52,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:58:52,551 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 8 states. [2020-10-20 05:58:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:58:52,789 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-10-20 05:58:52,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 05:58:52,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-10-20 05:58:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:58:52,791 INFO L225 Difference]: With dead ends: 70 [2020-10-20 05:58:52,791 INFO L226 Difference]: Without dead ends: 70 [2020-10-20 05:58:52,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:58:52,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-20 05:58:52,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-20 05:58:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-20 05:58:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2020-10-20 05:58:52,796 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 28 [2020-10-20 05:58:52,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:58:52,797 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2020-10-20 05:58:52,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:58:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-10-20 05:58:52,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-20 05:58:52,798 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:58:52,799 INFO L422 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] [2020-10-20 05:58:52,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 05:58:52,799 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:58:52,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:58:52,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1874289326, now seen corresponding path program 1 times [2020-10-20 05:58:52,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:58:52,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493687843] [2020-10-20 05:58:52,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:58:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:52,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:58:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:52,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:58:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:58:52,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493687843] [2020-10-20 05:58:52,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:58:52,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 05:58:52,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409077921] [2020-10-20 05:58:52,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:58:52,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:58:52,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:58:52,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:58:52,934 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 8 states. [2020-10-20 05:58:53,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:58:53,221 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2020-10-20 05:58:53,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 05:58:53,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-10-20 05:58:53,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:58:53,223 INFO L225 Difference]: With dead ends: 69 [2020-10-20 05:58:53,223 INFO L226 Difference]: Without dead ends: 69 [2020-10-20 05:58:53,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:58:53,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-20 05:58:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-10-20 05:58:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-20 05:58:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2020-10-20 05:58:53,227 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 29 [2020-10-20 05:58:53,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:58:53,227 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2020-10-20 05:58:53,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:58:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-10-20 05:58:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-20 05:58:53,229 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:58:53,229 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:58:53,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 05:58:53,230 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:58:53,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:58:53,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1280977847, now seen corresponding path program 1 times [2020-10-20 05:58:53,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:58:53,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852333939] [2020-10-20 05:58:53,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:58:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:53,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:58:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:53,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:58:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:58:53,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852333939] [2020-10-20 05:58:53,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677450655] [2020-10-20 05:58:53,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:58:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:58:53,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 41 conjunts are in the unsatisfiable core [2020-10-20 05:58:53,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:58:53,650 INFO L384 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 [2020-10-20 05:58:53,650 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:58:53,658 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:58:53,658 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:58:53,659 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-10-20 05:58:53,701 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:58:53,702 INFO L384 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 [2020-10-20 05:58:53,703 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:58:53,708 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:58:53,708 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:58:53,708 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:7 [2020-10-20 05:58:53,719 INFO L384 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 [2020-10-20 05:58:53,720 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:58:53,724 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:58:53,725 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:58:53,725 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-10-20 05:58:53,819 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:58:53,819 INFO L384 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 16 treesize of output 44 [2020-10-20 05:58:53,820 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:58:53,841 INFO L625 ElimStorePlain]: treesize reduction 26, result has 44.7 percent of original size [2020-10-20 05:58:53,843 INFO L545 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. [2020-10-20 05:58:53,843 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2020-10-20 05:58:53,953 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 05:58:53,977 INFO L350 Elim1Store]: treesize reduction 48, result has 27.3 percent of original size [2020-10-20 05:58:53,977 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 30 [2020-10-20 05:58:53,978 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:58:54,002 INFO L625 ElimStorePlain]: treesize reduction 11, result has 76.1 percent of original size [2020-10-20 05:58:54,007 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 05:58:54,007 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:32 [2020-10-20 05:58:54,173 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:58:54,174 INFO L384 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 28 treesize of output 24 [2020-10-20 05:58:54,175 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:58:54,183 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:58:54,187 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:58:54,188 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:11 [2020-10-20 05:58:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:58:54,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:58:54,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2020-10-20 05:58:54,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273051407] [2020-10-20 05:58:54,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-20 05:58:54,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:58:54,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-20 05:58:54,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2020-10-20 05:58:54,207 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 19 states. [2020-10-20 05:58:56,278 WARN L193 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2020-10-20 05:58:58,139 WARN L193 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2020-10-20 05:59:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:59:00,991 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2020-10-20 05:59:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-20 05:59:00,991 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2020-10-20 05:59:00,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:59:00,993 INFO L225 Difference]: With dead ends: 75 [2020-10-20 05:59:00,993 INFO L226 Difference]: Without dead ends: 75 [2020-10-20 05:59:00,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=157, Invalid=712, Unknown=1, NotChecked=0, Total=870 [2020-10-20 05:59:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-10-20 05:59:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2020-10-20 05:59:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-20 05:59:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2020-10-20 05:59:01,005 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 30 [2020-10-20 05:59:01,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:59:01,006 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2020-10-20 05:59:01,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-20 05:59:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2020-10-20 05:59:01,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-20 05:59:01,014 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:59:01,015 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:59:01,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-10-20 05:59:01,230 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:59:01,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:59:01,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1280977846, now seen corresponding path program 1 times [2020-10-20 05:59:01,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:59:01,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079276744] [2020-10-20 05:59:01,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:59:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:01,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:59:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:01,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:59:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:01,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079276744] [2020-10-20 05:59:01,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021849922] [2020-10-20 05:59:01,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:59:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:01,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 44 conjunts are in the unsatisfiable core [2020-10-20 05:59:01,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:59:01,740 INFO L384 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 [2020-10-20 05:59:01,741 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:01,747 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:01,747 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:01,748 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-10-20 05:59:01,837 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:01,838 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-10-20 05:59:01,839 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:01,864 INFO L625 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2020-10-20 05:59:01,866 INFO L545 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. [2020-10-20 05:59:01,866 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2020-10-20 05:59:01,939 INFO L384 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 [2020-10-20 05:59:01,940 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:01,953 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:01,957 INFO L384 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 [2020-10-20 05:59:01,958 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:01,970 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:01,973 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:59:01,973 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:38 [2020-10-20 05:59:02,175 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:02,175 INFO L384 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 31 treesize of output 53 [2020-10-20 05:59:02,176 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:02,209 INFO L625 ElimStorePlain]: treesize reduction 26, result has 59.4 percent of original size [2020-10-20 05:59:02,211 INFO L545 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. [2020-10-20 05:59:02,214 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:38 [2020-10-20 05:59:02,353 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 05:59:02,368 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-10-20 05:59:02,368 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 20 [2020-10-20 05:59:02,369 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:02,389 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:02,393 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 05:59:02,405 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-10-20 05:59:02,405 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 21 [2020-10-20 05:59:02,407 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:02,423 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:02,426 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 05:59:02,427 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:68, output treesize:57 [2020-10-20 05:59:02,588 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:02,588 INFO L384 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 28 treesize of output 24 [2020-10-20 05:59:02,589 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:02,604 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:02,614 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:02,614 INFO L384 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 33 treesize of output 25 [2020-10-20 05:59:02,615 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:02,629 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:02,631 INFO L545 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. [2020-10-20 05:59:02,632 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:71, output treesize:17 [2020-10-20 05:59:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:02,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:59:02,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2020-10-20 05:59:02,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069050185] [2020-10-20 05:59:02,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-20 05:59:02,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:59:02,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-20 05:59:02,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2020-10-20 05:59:02,661 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 22 states. [2020-10-20 05:59:03,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:59:03,821 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2020-10-20 05:59:03,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 05:59:03,822 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2020-10-20 05:59:03,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:59:03,823 INFO L225 Difference]: With dead ends: 74 [2020-10-20 05:59:03,823 INFO L226 Difference]: Without dead ends: 74 [2020-10-20 05:59:03,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2020-10-20 05:59:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-20 05:59:03,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2020-10-20 05:59:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-20 05:59:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2020-10-20 05:59:03,830 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 30 [2020-10-20 05:59:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:59:03,831 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2020-10-20 05:59:03,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-20 05:59:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2020-10-20 05:59:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-20 05:59:03,831 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:59:03,832 INFO L422 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] [2020-10-20 05:59:04,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-10-20 05:59:04,038 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:59:04,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:59:04,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2026572939, now seen corresponding path program 1 times [2020-10-20 05:59:04,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:59:04,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155403730] [2020-10-20 05:59:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:59:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:04,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:59:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:04,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:59:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:04,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155403730] [2020-10-20 05:59:04,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:59:04,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 05:59:04,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251892768] [2020-10-20 05:59:04,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 05:59:04,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:59:04,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 05:59:04,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-20 05:59:04,127 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 7 states. [2020-10-20 05:59:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:59:04,339 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2020-10-20 05:59:04,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:59:04,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-10-20 05:59:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:59:04,341 INFO L225 Difference]: With dead ends: 71 [2020-10-20 05:59:04,341 INFO L226 Difference]: Without dead ends: 71 [2020-10-20 05:59:04,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-20 05:59:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-20 05:59:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-20 05:59:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-20 05:59:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2020-10-20 05:59:04,348 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 30 [2020-10-20 05:59:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:59:04,348 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2020-10-20 05:59:04,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 05:59:04,349 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2020-10-20 05:59:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-20 05:59:04,350 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:59:04,350 INFO L422 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] [2020-10-20 05:59:04,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 05:59:04,351 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:59:04,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:59:04,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1600748433, now seen corresponding path program 1 times [2020-10-20 05:59:04,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:59:04,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313298229] [2020-10-20 05:59:04,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:59:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:04,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:59:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:04,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:59:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:04,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313298229] [2020-10-20 05:59:04,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:59:04,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 05:59:04,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294247956] [2020-10-20 05:59:04,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 05:59:04,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:59:04,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 05:59:04,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:59:04,554 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 9 states. [2020-10-20 05:59:04,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:59:04,789 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2020-10-20 05:59:04,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 05:59:04,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-10-20 05:59:04,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:59:04,791 INFO L225 Difference]: With dead ends: 70 [2020-10-20 05:59:04,792 INFO L226 Difference]: Without dead ends: 70 [2020-10-20 05:59:04,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:59:04,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-20 05:59:04,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-20 05:59:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-20 05:59:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2020-10-20 05:59:04,799 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 31 [2020-10-20 05:59:04,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:59:04,800 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2020-10-20 05:59:04,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 05:59:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2020-10-20 05:59:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-20 05:59:04,802 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:59:04,803 INFO L422 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] [2020-10-20 05:59:04,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 05:59:04,803 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:59:04,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:59:04,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1600748434, now seen corresponding path program 1 times [2020-10-20 05:59:04,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:59:04,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466433309] [2020-10-20 05:59:04,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:59:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:04,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:59:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:04,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:59:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:04,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466433309] [2020-10-20 05:59:04,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:59:04,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 05:59:04,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793528426] [2020-10-20 05:59:04,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:59:04,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:59:04,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:59:04,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:59:04,893 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 6 states. [2020-10-20 05:59:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:59:05,054 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2020-10-20 05:59:05,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 05:59:05,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-10-20 05:59:05,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:59:05,058 INFO L225 Difference]: With dead ends: 66 [2020-10-20 05:59:05,058 INFO L226 Difference]: Without dead ends: 66 [2020-10-20 05:59:05,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-20 05:59:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-20 05:59:05,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-10-20 05:59:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-20 05:59:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2020-10-20 05:59:05,061 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 31 [2020-10-20 05:59:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:59:05,061 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2020-10-20 05:59:05,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:59:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2020-10-20 05:59:05,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 05:59:05,062 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:59:05,062 INFO L422 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, 1, 1] [2020-10-20 05:59:05,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 05:59:05,063 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:59:05,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:59:05,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1346610171, now seen corresponding path program 1 times [2020-10-20 05:59:05,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:59:05,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997018883] [2020-10-20 05:59:05,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:59:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 05:59:05,099 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 05:59:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 05:59:05,122 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 05:59:05,150 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 05:59:05,151 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 05:59:05,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 05:59:05,174 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-10-20 05:59:05,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 05:59:05 BoogieIcfgContainer [2020-10-20 05:59:05,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 05:59:05,198 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 05:59:05,199 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 05:59:05,199 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 05:59:05,199 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:58:47" (3/4) ... [2020-10-20 05:59:05,203 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 05:59:05,204 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 05:59:05,205 INFO L168 Benchmark]: Toolchain (without parser) took 19242.48 ms. Allocated memory was 41.9 MB in the beginning and 115.9 MB in the end (delta: 73.9 MB). Free memory was 20.0 MB in the beginning and 54.4 MB in the end (delta: -34.4 MB). Peak memory consumption was 39.5 MB. Max. memory is 14.3 GB. [2020-10-20 05:59:05,206 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 32.0 MB. Free memory was 9.3 MB in the beginning and 9.2 MB in the end (delta: 47.7 kB). Peak memory consumption was 47.7 kB. Max. memory is 14.3 GB. [2020-10-20 05:59:05,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.91 ms. Allocated memory was 41.9 MB in the beginning and 44.0 MB in the end (delta: 2.1 MB). Free memory was 19.2 MB in the beginning and 26.3 MB in the end (delta: -7.1 MB). Peak memory consumption was 10.7 MB. Max. memory is 14.3 GB. [2020-10-20 05:59:05,207 INFO L168 Benchmark]: Boogie Preprocessor took 121.96 ms. Allocated memory is still 44.0 MB. Free memory was 26.1 MB in the beginning and 23.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 14.3 GB. [2020-10-20 05:59:05,207 INFO L168 Benchmark]: RCFGBuilder took 816.16 ms. Allocated memory was 44.0 MB in the beginning and 47.2 MB in the end (delta: 3.1 MB). Free memory was 23.0 MB in the beginning and 23.1 MB in the end (delta: -159.5 kB). Peak memory consumption was 17.8 MB. Max. memory is 14.3 GB. [2020-10-20 05:59:05,208 INFO L168 Benchmark]: TraceAbstraction took 17580.36 ms. Allocated memory was 47.2 MB in the beginning and 115.9 MB in the end (delta: 68.7 MB). Free memory was 22.8 MB in the beginning and 56.1 MB in the end (delta: -33.3 MB). Peak memory consumption was 35.4 MB. Max. memory is 14.3 GB. [2020-10-20 05:59:05,208 INFO L168 Benchmark]: Witness Printer took 5.33 ms. Allocated memory is still 115.9 MB. Free memory is still 54.4 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 05:59:05,211 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 32.0 MB. Free memory was 9.3 MB in the beginning and 9.2 MB in the end (delta: 47.7 kB). Peak memory consumption was 47.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 708.91 ms. Allocated memory was 41.9 MB in the beginning and 44.0 MB in the end (delta: 2.1 MB). Free memory was 19.2 MB in the beginning and 26.3 MB in the end (delta: -7.1 MB). Peak memory consumption was 10.7 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 121.96 ms. Allocated memory is still 44.0 MB. Free memory was 26.1 MB in the beginning and 23.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 14.3 GB. * RCFGBuilder took 816.16 ms. Allocated memory was 44.0 MB in the beginning and 47.2 MB in the end (delta: 3.1 MB). Free memory was 23.0 MB in the beginning and 23.1 MB in the end (delta: -159.5 kB). Peak memory consumption was 17.8 MB. Max. memory is 14.3 GB. * TraceAbstraction took 17580.36 ms. Allocated memory was 47.2 MB in the beginning and 115.9 MB in the end (delta: 68.7 MB). Free memory was 22.8 MB in the beginning and 56.1 MB in the end (delta: -33.3 MB). Peak memory consumption was 35.4 MB. Max. memory is 14.3 GB. * Witness Printer took 5.33 ms. Allocated memory is still 115.9 MB. Free memory is still 54.4 MB. There was no memory consumed. Max. memory is 14.3 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: 539]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 539. Possible FailurePath: [L524] int c = 0; VAL [\old(c)=55, c=0] [L541] struct item *list = ((void *)0); [L542] int length = 0; VAL [\old(c)=0, c=0, length=0, list={3:0}] [L544] CALL append(&list) VAL [\old(c)=0, c=0, plist={3:0}] [L531] c++ [L532] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L533] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L533] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L534] EXPR item->next VAL [\old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, \old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={-1:0}, plist={3:0}, plist={3:0}] [L534-L536] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, \old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={-1:0}, plist={3:0}, plist={3:0}] [L537] *plist = item VAL [\old(c)=0, c=1, item={1:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={-1:0}, plist={3:0}, plist={3:0}] [L544] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={3:0}] [L545] length++ VAL [\old(c)=0, c=1, length=1, list={3:0}] [L546] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L547] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={3:0}] [L548] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={3:0}] [L551] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={3:0}] [L551] EXPR list->next VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={3:0}, list->next={0:0}] [L551] struct item *next = list->next; [L552] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={3:0}, next={0:0}] [L552] free(list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={3:0}, next={0:0}] [L552] free(list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={3:0}, next={0:0}] [L552] free(list) [L553] list = next VAL [\old(c)=0, c=1, length=1, list={3:0}, next={0:0}] [L554] length-- VAL [\old(c)=0, c=1, length=0, list={3:0}, next={0:0}] [L556] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={3:0}, next={0:0}] [L562] return 0; [L541] struct item *list = ((void *)0); [L562] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 119 locations, 45 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.4s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 912 SDtfs, 884 SDslu, 2603 SDs, 0 SdLazy, 3830 SolverSat, 188 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=2, 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, 17 MinimizatonAttempts, 62 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 473 NumberOfCodeBlocks, 473 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 419 ConstructedInterpolants, 20 QuantifiedInterpolants, 104454 SizeOfPredicates, 36 NumberOfNonLiveVariables, 520 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 6/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: 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... ### Bit-precise run ### This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 05:59:07,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 05:59:07,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 05:59:07,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 05:59:07,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 05:59:07,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 05:59:07,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 05:59:07,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 05:59:07,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 05:59:07,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 05:59:07,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 05:59:07,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 05:59:07,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 05:59:07,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 05:59:07,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 05:59:07,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 05:59:07,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 05:59:07,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 05:59:07,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 05:59:07,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 05:59:07,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 05:59:07,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 05:59:07,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 05:59:07,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 05:59:07,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 05:59:07,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 05:59:07,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 05:59:07,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 05:59:07,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 05:59:07,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 05:59:07,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 05:59:07,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 05:59:07,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 05:59:07,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 05:59:07,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 05:59:07,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 05:59:07,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 05:59:07,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 05:59:07,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 05:59:07,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 05:59:07,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 05:59:07,518 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2020-10-20 05:59:07,558 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 05:59:07,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 05:59:07,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 05:59:07,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 05:59:07,562 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 05:59:07,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 05:59:07,563 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 05:59:07,563 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 05:59:07,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 05:59:07,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 05:59:07,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 05:59:07,565 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-10-20 05:59:07,565 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-10-20 05:59:07,565 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-10-20 05:59:07,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 05:59:07,566 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-10-20 05:59:07,566 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-20 05:59:07,566 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-20 05:59:07,566 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 05:59:07,566 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 05:59:07,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 05:59:07,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 05:59:07,567 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 05:59:07,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 05:59:07,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 05:59:07,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 05:59:07,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 05:59:07,568 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-20 05:59:07,569 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-20 05:59:07,569 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 05:59:07,569 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-20 05:59:07,569 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 -> 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 [2020-10-20 05:59:07,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 05:59:07,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 05:59:07,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 05:59:07,814 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 05:59:07,814 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 05:59:07,815 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2020-10-20 05:59:07,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96fe486f/ce42ee10ee914497bb0d19525f38a4c7/FLAG8d02e4f44 [2020-10-20 05:59:08,405 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 05:59:08,406 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2020-10-20 05:59:08,419 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96fe486f/ce42ee10ee914497bb0d19525f38a4c7/FLAG8d02e4f44 [2020-10-20 05:59:08,730 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96fe486f/ce42ee10ee914497bb0d19525f38a4c7 [2020-10-20 05:59:08,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 05:59:08,741 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-20 05:59:08,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 05:59:08,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 05:59:08,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 05:59:08,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:59:08" (1/1) ... [2020-10-20 05:59:08,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6fdbad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:59:08, skipping insertion in model container [2020-10-20 05:59:08,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:59:08" (1/1) ... [2020-10-20 05:59:08,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 05:59:08,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 05:59:09,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 05:59:09,230 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 05:59:09,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 05:59:09,361 INFO L208 MainTranslator]: Completed translation [2020-10-20 05:59:09,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:59:09 WrapperNode [2020-10-20 05:59:09,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 05:59:09,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 05:59:09,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 05:59:09,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 05:59:09,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:59:09" (1/1) ... [2020-10-20 05:59:09,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:59:09" (1/1) ... [2020-10-20 05:59:09,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:59:09" (1/1) ... [2020-10-20 05:59:09,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:59:09" (1/1) ... [2020-10-20 05:59:09,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:59:09" (1/1) ... [2020-10-20 05:59:09,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:59:09" (1/1) ... [2020-10-20 05:59:09,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:59:09" (1/1) ... [2020-10-20 05:59:09,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 05:59:09,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 05:59:09,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 05:59:09,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 05:59:09,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:59:09" (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 [2020-10-20 05:59:09,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-20 05:59:09,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 05:59:09,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-10-20 05:59:09,565 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-20 05:59:09,565 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-10-20 05:59:09,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-10-20 05:59:09,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-10-20 05:59:09,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-10-20 05:59:09,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-10-20 05:59:09,573 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2020-10-20 05:59:09,573 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-20 05:59:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-20 05:59:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-20 05:59:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-20 05:59:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-20 05:59:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-20 05:59:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 05:59:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-10-20 05:59:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-10-20 05:59:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-10-20 05:59:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-10-20 05:59:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-10-20 05:59:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-10-20 05:59:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-10-20 05:59:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-10-20 05:59:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-10-20 05:59:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-10-20 05:59:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-10-20 05:59:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-10-20 05:59:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-10-20 05:59:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-10-20 05:59:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-10-20 05:59:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-10-20 05:59:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-10-20 05:59:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-10-20 05:59:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-10-20 05:59:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-10-20 05:59:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-10-20 05:59:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-10-20 05:59:09,580 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-10-20 05:59:09,580 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-10-20 05:59:09,580 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-10-20 05:59:09,580 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-10-20 05:59:09,580 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-10-20 05:59:09,581 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-10-20 05:59:09,581 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-10-20 05:59:09,581 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-10-20 05:59:09,581 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-10-20 05:59:09,582 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-10-20 05:59:09,582 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-10-20 05:59:09,582 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-10-20 05:59:09,582 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-10-20 05:59:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-10-20 05:59:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-10-20 05:59:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-10-20 05:59:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-10-20 05:59:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-10-20 05:59:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-10-20 05:59:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-10-20 05:59:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-10-20 05:59:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-10-20 05:59:09,585 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-10-20 05:59:09,585 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-10-20 05:59:09,585 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-10-20 05:59:09,585 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-10-20 05:59:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-10-20 05:59:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-10-20 05:59:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-10-20 05:59:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-10-20 05:59:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-10-20 05:59:09,587 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-10-20 05:59:09,587 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-10-20 05:59:09,588 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-20 05:59:09,588 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-20 05:59:09,588 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-20 05:59:09,588 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-20 05:59:09,588 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-10-20 05:59:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-20 05:59:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-10-20 05:59:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-10-20 05:59:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-10-20 05:59:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-10-20 05:59:09,590 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-10-20 05:59:09,590 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-20 05:59:09,590 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-10-20 05:59:09,590 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-10-20 05:59:09,590 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-10-20 05:59:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-10-20 05:59:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-10-20 05:59:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-10-20 05:59:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-10-20 05:59:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-10-20 05:59:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-10-20 05:59:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-10-20 05:59:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-10-20 05:59:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-10-20 05:59:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-10-20 05:59:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-10-20 05:59:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-10-20 05:59:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-10-20 05:59:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-10-20 05:59:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-10-20 05:59:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-10-20 05:59:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-10-20 05:59:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-10-20 05:59:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-10-20 05:59:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-10-20 05:59:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-10-20 05:59:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-10-20 05:59:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-10-20 05:59:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-10-20 05:59:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-10-20 05:59:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-10-20 05:59:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-10-20 05:59:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-10-20 05:59:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-10-20 05:59:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-10-20 05:59:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-10-20 05:59:09,597 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-10-20 05:59:09,597 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-10-20 05:59:09,597 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-10-20 05:59:09,597 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-10-20 05:59:09,597 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-10-20 05:59:09,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-20 05:59:09,598 INFO L130 BoogieDeclarations]: Found specification of procedure append [2020-10-20 05:59:09,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 05:59:09,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 05:59:09,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 05:59:09,599 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-20 05:59:09,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-10-20 05:59:09,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 05:59:09,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-20 05:59:09,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-20 05:59:09,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 05:59:09,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-10-20 05:59:09,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2020-10-20 05:59:09,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2020-10-20 05:59:10,446 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 05:59:10,447 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-10-20 05:59:10,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:59:10 BoogieIcfgContainer [2020-10-20 05:59:10,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 05:59:10,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 05:59:10,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 05:59:10,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 05:59:10,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 05:59:08" (1/3) ... [2020-10-20 05:59:10,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae8cb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:59:10, skipping insertion in model container [2020-10-20 05:59:10,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:59:09" (2/3) ... [2020-10-20 05:59:10,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae8cb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:59:10, skipping insertion in model container [2020-10-20 05:59:10,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:59:10" (3/3) ... [2020-10-20 05:59:10,458 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2020-10-20 05:59:10,469 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 05:59:10,477 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2020-10-20 05:59:10,491 INFO L253 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2020-10-20 05:59:10,512 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 05:59:10,512 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-20 05:59:10,512 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 05:59:10,513 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 05:59:10,513 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 05:59:10,513 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 05:59:10,513 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 05:59:10,514 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 05:59:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-10-20 05:59:10,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 05:59:10,543 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:59:10,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:59:10,545 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:59:10,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:59:10,552 INFO L82 PathProgramCache]: Analyzing trace with hash 920803252, now seen corresponding path program 1 times [2020-10-20 05:59:10,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:59:10,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116329442] [2020-10-20 05:59:10,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-20 05:59:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:10,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 05:59:10,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:59:10,846 INFO L384 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 [2020-10-20 05:59:10,847 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:10,855 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:10,855 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:10,856 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-20 05:59:10,913 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:10,914 INFO L384 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 14 treesize of output 30 [2020-10-20 05:59:10,916 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:10,935 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-10-20 05:59:10,937 INFO L545 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. [2020-10-20 05:59:10,937 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2020-10-20 05:59:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:10,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:59:11,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:11,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116329442] [2020-10-20 05:59:11,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:59:11,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-20 05:59:11,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327400595] [2020-10-20 05:59:11,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 05:59:11,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:59:11,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 05:59:11,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 05:59:11,034 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 5 states. [2020-10-20 05:59:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:59:11,443 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2020-10-20 05:59:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 05:59:11,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-20 05:59:11,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:59:11,456 INFO L225 Difference]: With dead ends: 94 [2020-10-20 05:59:11,457 INFO L226 Difference]: Without dead ends: 91 [2020-10-20 05:59:11,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:59:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-20 05:59:11,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2020-10-20 05:59:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-10-20 05:59:11,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2020-10-20 05:59:11,503 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 9 [2020-10-20 05:59:11,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:59:11,503 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2020-10-20 05:59:11,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 05:59:11,504 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2020-10-20 05:59:11,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 05:59:11,504 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:59:11,505 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:59:11,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-20 05:59:11,720 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:59:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:59:11,720 INFO L82 PathProgramCache]: Analyzing trace with hash 920803253, now seen corresponding path program 1 times [2020-10-20 05:59:11,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:59:11,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771857832] [2020-10-20 05:59:11,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-20 05:59:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:11,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 05:59:11,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:59:11,878 INFO L384 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 [2020-10-20 05:59:11,879 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:11,887 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:11,892 INFO L384 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 [2020-10-20 05:59:11,893 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:11,901 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:11,901 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:11,902 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-10-20 05:59:11,985 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:11,985 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-10-20 05:59:11,986 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:11,997 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:12,002 INFO L384 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 [2020-10-20 05:59:12,003 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:12,022 INFO L625 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2020-10-20 05:59:12,023 INFO L545 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. [2020-10-20 05:59:12,023 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:16 [2020-10-20 05:59:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:12,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:59:12,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:59:14,141 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_append_#t~malloc6.base_3| (_ BitVec 32))) (or (bvule (bvadd |c_append_#in~plist.offset| (_ bv4 32)) (select (store |c_#length| |v_append_#t~malloc6.base_3| (_ bv8 32)) |c_append_#in~plist.base|)) (not (= (_ bv0 1) (select |c_#valid| |v_append_#t~malloc6.base_3|))))) (or (forall ((|v_append_#t~malloc6.base_3| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_append_#t~malloc6.base_3|)))) (bvule |c_append_#in~plist.offset| (bvadd |c_append_#in~plist.offset| (_ bv4 32))))) is different from false [2020-10-20 05:59:14,795 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-10-20 05:59:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:14,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771857832] [2020-10-20 05:59:14,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:59:14,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-10-20 05:59:14,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485844093] [2020-10-20 05:59:14,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:59:14,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:59:14,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:59:14,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2020-10-20 05:59:14,825 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 8 states. [2020-10-20 05:59:33,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:59:33,934 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2020-10-20 05:59:33,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:59:33,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2020-10-20 05:59:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:59:33,945 INFO L225 Difference]: With dead ends: 123 [2020-10-20 05:59:33,947 INFO L226 Difference]: Without dead ends: 123 [2020-10-20 05:59:33,948 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2020-10-20 05:59:33,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-10-20 05:59:33,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 95. [2020-10-20 05:59:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-20 05:59:33,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2020-10-20 05:59:33,965 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 9 [2020-10-20 05:59:33,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:59:33,965 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2020-10-20 05:59:33,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:59:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2020-10-20 05:59:33,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 05:59:33,966 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:59:33,966 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:59:34,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-20 05:59:34,169 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:59:34,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:59:34,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1519870147, now seen corresponding path program 1 times [2020-10-20 05:59:34,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:59:34,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237730317] [2020-10-20 05:59:34,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-20 05:59:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:34,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 05:59:34,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:59:34,322 INFO L384 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 [2020-10-20 05:59:34,323 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:34,331 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:34,331 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:34,332 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-20 05:59:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:34,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:59:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:34,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237730317] [2020-10-20 05:59:34,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:59:34,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-20 05:59:34,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769511265] [2020-10-20 05:59:34,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 05:59:34,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:59:34,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 05:59:34,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 05:59:34,359 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 3 states. [2020-10-20 05:59:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:59:34,538 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2020-10-20 05:59:34,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 05:59:34,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-20 05:59:34,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:59:34,541 INFO L225 Difference]: With dead ends: 91 [2020-10-20 05:59:34,541 INFO L226 Difference]: Without dead ends: 91 [2020-10-20 05:59:34,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 05:59:34,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-20 05:59:34,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-10-20 05:59:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-20 05:59:34,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2020-10-20 05:59:34,551 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 10 [2020-10-20 05:59:34,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:59:34,552 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2020-10-20 05:59:34,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 05:59:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2020-10-20 05:59:34,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 05:59:34,553 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:59:34,553 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:59:34,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-20 05:59:34,765 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:59:34,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:59:34,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1519870146, now seen corresponding path program 1 times [2020-10-20 05:59:34,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:59:34,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589615101] [2020-10-20 05:59:34,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-20 05:59:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:34,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 05:59:34,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:59:34,886 INFO L384 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 [2020-10-20 05:59:34,886 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:34,892 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:34,892 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:34,892 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-20 05:59:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:34,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:59:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:34,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589615101] [2020-10-20 05:59:34,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:59:34,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-10-20 05:59:34,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162535923] [2020-10-20 05:59:34,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 05:59:34,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:59:34,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 05:59:34,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 05:59:34,945 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 4 states. [2020-10-20 05:59:35,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:59:35,196 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2020-10-20 05:59:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 05:59:35,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-20 05:59:35,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:59:35,198 INFO L225 Difference]: With dead ends: 87 [2020-10-20 05:59:35,198 INFO L226 Difference]: Without dead ends: 87 [2020-10-20 05:59:35,198 INFO L677 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 [2020-10-20 05:59:35,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-20 05:59:35,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-10-20 05:59:35,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-20 05:59:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2020-10-20 05:59:35,206 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 10 [2020-10-20 05:59:35,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:59:35,206 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2020-10-20 05:59:35,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 05:59:35,206 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2020-10-20 05:59:35,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 05:59:35,207 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:59:35,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:59:35,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-20 05:59:35,412 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:59:35,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:59:35,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1020530207, now seen corresponding path program 1 times [2020-10-20 05:59:35,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:59:35,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228131920] [2020-10-20 05:59:35,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-20 05:59:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:35,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-20 05:59:35,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:59:35,665 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-10-20 05:59:35,666 INFO L384 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 [2020-10-20 05:59:35,667 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:35,681 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:35,703 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-10-20 05:59:35,704 INFO L384 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 [2020-10-20 05:59:35,705 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:35,719 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:35,721 INFO L545 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. [2020-10-20 05:59:35,722 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:37 [2020-10-20 05:59:35,786 INFO L384 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 [2020-10-20 05:59:35,787 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:35,796 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:35,799 INFO L384 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 [2020-10-20 05:59:35,799 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:35,804 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:35,805 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:35,805 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2020-10-20 05:59:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:35,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:59:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:35,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228131920] [2020-10-20 05:59:35,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:59:35,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 9 [2020-10-20 05:59:35,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58711538] [2020-10-20 05:59:35,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 05:59:35,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:59:35,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 05:59:35,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:59:35,875 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand 9 states. [2020-10-20 05:59:36,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:59:36,480 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2020-10-20 05:59:36,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 05:59:36,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-20 05:59:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:59:36,481 INFO L225 Difference]: With dead ends: 99 [2020-10-20 05:59:36,482 INFO L226 Difference]: Without dead ends: 99 [2020-10-20 05:59:36,482 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-10-20 05:59:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-20 05:59:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2020-10-20 05:59:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-20 05:59:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2020-10-20 05:59:36,493 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 15 [2020-10-20 05:59:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:59:36,493 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2020-10-20 05:59:36,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 05:59:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2020-10-20 05:59:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 05:59:36,495 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:59:36,495 INFO L422 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] [2020-10-20 05:59:36,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-20 05:59:36,708 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:59:36,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:59:36,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1002042865, now seen corresponding path program 1 times [2020-10-20 05:59:36,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:59:36,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996932396] [2020-10-20 05:59:36,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-20 05:59:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:36,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 05:59:36,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:59:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:36,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:59:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:36,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996932396] [2020-10-20 05:59:36,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:59:36,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-20 05:59:36,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844019063] [2020-10-20 05:59:36,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:59:36,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:59:36,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:59:36,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:59:36,891 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 6 states. [2020-10-20 05:59:36,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:59:36,993 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2020-10-20 05:59:36,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:59:36,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-20 05:59:36,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:59:36,997 INFO L225 Difference]: With dead ends: 140 [2020-10-20 05:59:36,997 INFO L226 Difference]: Without dead ends: 140 [2020-10-20 05:59:36,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 05:59:36,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-10-20 05:59:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 98. [2020-10-20 05:59:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-10-20 05:59:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2020-10-20 05:59:37,028 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 24 [2020-10-20 05:59:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:59:37,029 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2020-10-20 05:59:37,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:59:37,031 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2020-10-20 05:59:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 05:59:37,033 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:59:37,033 INFO L422 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] [2020-10-20 05:59:37,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-20 05:59:37,234 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:59:37,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:59:37,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1003265060, now seen corresponding path program 1 times [2020-10-20 05:59:37,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:59:37,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640524844] [2020-10-20 05:59:37,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-20 05:59:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:37,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 05:59:37,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:59:37,452 INFO L384 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 [2020-10-20 05:59:37,452 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:37,473 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:37,479 INFO L384 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 [2020-10-20 05:59:37,480 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:37,497 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:37,499 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:37,499 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2020-10-20 05:59:37,560 INFO L384 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 [2020-10-20 05:59:37,561 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:37,575 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:37,578 INFO L384 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 [2020-10-20 05:59:37,578 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:37,587 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:37,587 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:37,588 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2020-10-20 05:59:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:37,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:59:38,011 INFO L384 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 36 treesize of output 28 [2020-10-20 05:59:38,014 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-10-20 05:59:38,049 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:38,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:59:38,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:59:38,054 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:38,076 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:38,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:59:38,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:59:38,081 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:38,101 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:38,102 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-20 05:59:38,102 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:19 [2020-10-20 05:59:38,170 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-20 05:59:38,193 INFO L384 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 [2020-10-20 05:59:38,194 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:59:38,206 INFO L384 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 [2020-10-20 05:59:38,207 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:59:38,223 INFO L384 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 [2020-10-20 05:59:38,224 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:59:38,236 INFO L384 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 [2020-10-20 05:59:38,236 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:59:38,306 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:38,307 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2020-10-20 05:59:38,307 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:45 [2020-10-20 05:59:38,530 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 19 [2020-10-20 05:59:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:38,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640524844] [2020-10-20 05:59:38,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:59:38,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2020-10-20 05:59:38,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300500021] [2020-10-20 05:59:38,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 05:59:38,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:59:38,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 05:59:38,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:59:38,568 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand 12 states. [2020-10-20 05:59:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:59:39,764 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2020-10-20 05:59:39,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:59:39,765 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-10-20 05:59:39,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:59:39,767 INFO L225 Difference]: With dead ends: 109 [2020-10-20 05:59:39,767 INFO L226 Difference]: Without dead ends: 109 [2020-10-20 05:59:39,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-10-20 05:59:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-20 05:59:39,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2020-10-20 05:59:39,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-20 05:59:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2020-10-20 05:59:39,775 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 24 [2020-10-20 05:59:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:59:39,775 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2020-10-20 05:59:39,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 05:59:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2020-10-20 05:59:39,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 05:59:39,776 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:59:39,776 INFO L422 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] [2020-10-20 05:59:39,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-20 05:59:39,982 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:59:39,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:59:39,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1003265061, now seen corresponding path program 1 times [2020-10-20 05:59:39,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:59:39,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974472913] [2020-10-20 05:59:39,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-20 05:59:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:40,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 05:59:40,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:59:40,143 INFO L384 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 [2020-10-20 05:59:40,143 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:40,151 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:40,151 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:40,152 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-10-20 05:59:40,179 INFO L384 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 [2020-10-20 05:59:40,180 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:40,187 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:40,187 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:40,187 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2020-10-20 05:59:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:40,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:59:40,288 INFO L384 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 [2020-10-20 05:59:40,289 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:59:40,312 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:40,313 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:59:40,314 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2020-10-20 05:59:40,392 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:59:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:40,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974472913] [2020-10-20 05:59:40,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:59:40,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2020-10-20 05:59:40,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749324832] [2020-10-20 05:59:40,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:59:40,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:59:40,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:59:40,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:59:40,408 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand 8 states. [2020-10-20 05:59:40,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:59:40,978 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2020-10-20 05:59:40,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:59:40,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-10-20 05:59:40,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:59:40,980 INFO L225 Difference]: With dead ends: 105 [2020-10-20 05:59:40,980 INFO L226 Difference]: Without dead ends: 105 [2020-10-20 05:59:40,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-20 05:59:40,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-20 05:59:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2020-10-20 05:59:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-20 05:59:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2020-10-20 05:59:40,993 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 24 [2020-10-20 05:59:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:59:40,994 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2020-10-20 05:59:40,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:59:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2020-10-20 05:59:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-20 05:59:40,995 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:59:40,998 INFO L422 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] [2020-10-20 05:59:41,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-20 05:59:41,200 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:59:41,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:59:41,200 INFO L82 PathProgramCache]: Analyzing trace with hash 408031290, now seen corresponding path program 1 times [2020-10-20 05:59:41,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:59:41,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62720858] [2020-10-20 05:59:41,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-10-20 05:59:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:41,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 05:59:41,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:59:41,385 INFO L384 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 [2020-10-20 05:59:41,385 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:41,389 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:41,389 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:41,390 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-10-20 05:59:41,409 INFO L384 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 [2020-10-20 05:59:41,410 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:41,412 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:41,412 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:41,412 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-10-20 05:59:41,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:41,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:59:41,504 INFO L384 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 [2020-10-20 05:59:41,511 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-10-20 05:59:41,519 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:41,519 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-20 05:59:41,520 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2020-10-20 05:59:41,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:41,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62720858] [2020-10-20 05:59:41,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:59:41,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-10-20 05:59:41,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130368949] [2020-10-20 05:59:41,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:59:41,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:59:41,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:59:41,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:59:41,529 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand 6 states. [2020-10-20 05:59:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:59:41,824 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2020-10-20 05:59:41,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:59:41,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-20 05:59:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:59:41,826 INFO L225 Difference]: With dead ends: 107 [2020-10-20 05:59:41,826 INFO L226 Difference]: Without dead ends: 107 [2020-10-20 05:59:41,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:59:41,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-20 05:59:41,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2020-10-20 05:59:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-20 05:59:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2020-10-20 05:59:41,835 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 27 [2020-10-20 05:59:41,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:59:41,835 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2020-10-20 05:59:41,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:59:41,835 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2020-10-20 05:59:41,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-20 05:59:41,836 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:59:41,837 INFO L422 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] [2020-10-20 05:59:42,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-20 05:59:42,046 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:59:42,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:59:42,047 INFO L82 PathProgramCache]: Analyzing trace with hash -235931780, now seen corresponding path program 1 times [2020-10-20 05:59:42,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:59:42,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208549577] [2020-10-20 05:59:42,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-10-20 05:59:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:42,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 05:59:42,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:59:42,259 INFO L384 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 [2020-10-20 05:59:42,260 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:42,270 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:42,271 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:42,271 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2020-10-20 05:59:42,316 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-10-20 05:59:42,317 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:42,323 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:42,324 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:42,324 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2020-10-20 05:59:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:42,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:59:42,529 INFO L384 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 [2020-10-20 05:59:42,533 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:59:42,571 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:42,572 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:59:42,572 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:24 [2020-10-20 05:59:42,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:42,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208549577] [2020-10-20 05:59:42,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:59:42,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2020-10-20 05:59:42,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933207521] [2020-10-20 05:59:42,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 05:59:42,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:59:42,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 05:59:42,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-20 05:59:42,647 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 11 states. [2020-10-20 05:59:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:59:43,373 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2020-10-20 05:59:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 05:59:43,374 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-10-20 05:59:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:59:43,375 INFO L225 Difference]: With dead ends: 106 [2020-10-20 05:59:43,376 INFO L226 Difference]: Without dead ends: 106 [2020-10-20 05:59:43,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-10-20 05:59:43,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-20 05:59:43,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2020-10-20 05:59:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-20 05:59:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2020-10-20 05:59:43,383 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 28 [2020-10-20 05:59:43,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:59:43,383 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2020-10-20 05:59:43,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 05:59:43,383 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2020-10-20 05:59:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-20 05:59:43,388 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:59:43,388 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:59:43,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-10-20 05:59:43,602 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:59:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:59:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2021644624, now seen corresponding path program 1 times [2020-10-20 05:59:43,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:59:43,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604994179] [2020-10-20 05:59:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-10-20 05:59:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:43,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-20 05:59:43,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:59:43,872 INFO L384 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 [2020-10-20 05:59:43,872 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:43,878 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:43,879 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:43,879 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-10-20 05:59:43,924 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:43,925 INFO L384 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 16 treesize of output 44 [2020-10-20 05:59:43,926 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:43,945 INFO L625 ElimStorePlain]: treesize reduction 26, result has 36.6 percent of original size [2020-10-20 05:59:43,945 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:43,946 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-10-20 05:59:44,036 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-10-20 05:59:44,036 INFO L384 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 [2020-10-20 05:59:44,037 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:44,047 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:44,048 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 05:59:44,048 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-10-20 05:59:44,093 INFO L384 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 [2020-10-20 05:59:44,093 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:44,101 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:44,102 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:59:44,102 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:13 [2020-10-20 05:59:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:44,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:59:44,311 INFO L384 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 [2020-10-20 05:59:44,312 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:59:44,335 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:44,335 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:59:44,336 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2020-10-20 05:59:44,442 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:59:44,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:59:44,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604994179] [2020-10-20 05:59:44,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:59:44,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2020-10-20 05:59:44,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833374815] [2020-10-20 05:59:44,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 05:59:44,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:59:44,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 05:59:44,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-20 05:59:44,458 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand 14 states. [2020-10-20 05:59:45,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:59:45,666 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2020-10-20 05:59:45,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 05:59:45,666 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2020-10-20 05:59:45,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:59:45,667 INFO L225 Difference]: With dead ends: 109 [2020-10-20 05:59:45,668 INFO L226 Difference]: Without dead ends: 109 [2020-10-20 05:59:45,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2020-10-20 05:59:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-20 05:59:45,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2020-10-20 05:59:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-10-20 05:59:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2020-10-20 05:59:45,672 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 29 [2020-10-20 05:59:45,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:59:45,673 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2020-10-20 05:59:45,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 05:59:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2020-10-20 05:59:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-20 05:59:45,674 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:59:45,674 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:59:45,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-10-20 05:59:45,884 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:59:45,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:59:45,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2021644625, now seen corresponding path program 1 times [2020-10-20 05:59:45,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:59:45,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274133665] [2020-10-20 05:59:45,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-10-20 05:59:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:46,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 31 conjunts are in the unsatisfiable core [2020-10-20 05:59:46,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:59:46,105 INFO L384 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 [2020-10-20 05:59:46,105 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:46,124 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:46,128 INFO L384 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 [2020-10-20 05:59:46,128 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:46,142 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:46,142 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:46,143 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2020-10-20 05:59:46,220 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:46,221 INFO L384 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 [2020-10-20 05:59:46,222 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:46,236 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:46,241 INFO L384 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 16 treesize of output 18 [2020-10-20 05:59:46,242 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:46,260 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:46,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274133665] [2020-10-20 05:59:46,262 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 32) [2020-10-20 05:59:46,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [544928607] [2020-10-20 05:59:46,262 INFO L95 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 [2020-10-20 05:59:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:46,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 36 conjunts are in the unsatisfiable core [2020-10-20 05:59:46,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:59:46,676 INFO L384 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 [2020-10-20 05:59:46,677 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:46,692 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:46,696 INFO L384 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 [2020-10-20 05:59:46,696 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:46,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:46,708 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:46,708 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2020-10-20 05:59:46,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:59:46,770 INFO L384 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 [2020-10-20 05:59:46,771 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:46,791 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:46,806 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:46,806 INFO L384 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 [2020-10-20 05:59:46,807 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:46,825 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:46,826 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 32) [2020-10-20 05:59:46,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711403099] [2020-10-20 05:59:46,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:59:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:59:46,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 31 conjunts are in the unsatisfiable core [2020-10-20 05:59:46,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:59:46,984 INFO L384 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 [2020-10-20 05:59:46,985 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:47,002 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:47,009 INFO L384 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 [2020-10-20 05:59:47,009 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:47,022 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:47,023 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:59:47,023 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2020-10-20 05:59:47,061 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:47,061 INFO L384 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 [2020-10-20 05:59:47,062 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:47,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:47,083 INFO L384 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 16 treesize of output 18 [2020-10-20 05:59:47,084 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:59:47,098 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:59:47,099 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 32) [2020-10-20 05:59:47,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:59:47,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-10-20 05:59:47,099 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-10-20 05:59:47,099 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 05:59:47,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3,14 cvc4 --incremental --print-success --lang smt --rewrite-divk,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:59:47,720 WARN L238 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-10-20 05:59:47,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 05:59:47 BoogieIcfgContainer [2020-10-20 05:59:47,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 05:59:47,721 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 05:59:47,721 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 05:59:47,721 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 05:59:47,722 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:59:10" (3/4) ... [2020-10-20 05:59:47,724 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 05:59:47,725 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 05:59:47,726 INFO L168 Benchmark]: Toolchain (without parser) took 38990.98 ms. Allocated memory was 40.9 MB in the beginning and 75.0 MB in the end (delta: 34.1 MB). Free memory was 17.5 MB in the beginning and 8.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 43.5 MB. Max. memory is 14.3 GB. [2020-10-20 05:59:47,726 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 30.9 MB. Free memory was 7.8 MB in the beginning and 7.8 MB in the end (delta: 43.8 kB). Peak memory consumption was 43.8 kB. Max. memory is 14.3 GB. [2020-10-20 05:59:47,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 620.30 ms. Allocated memory was 40.9 MB in the beginning and 42.5 MB in the end (delta: 1.6 MB). Free memory was 16.6 MB in the beginning and 16.3 MB in the end (delta: 310.9 kB). Peak memory consumption was 7.3 MB. Max. memory is 14.3 GB. [2020-10-20 05:59:47,727 INFO L168 Benchmark]: Boogie Preprocessor took 134.07 ms. Allocated memory is still 42.5 MB. Free memory was 16.3 MB in the beginning and 12.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. [2020-10-20 05:59:47,728 INFO L168 Benchmark]: RCFGBuilder took 951.71 ms. Allocated memory was 42.5 MB in the beginning and 46.7 MB in the end (delta: 4.2 MB). Free memory was 12.7 MB in the beginning and 18.4 MB in the end (delta: -5.7 MB). Peak memory consumption was 5.3 MB. Max. memory is 14.3 GB. [2020-10-20 05:59:47,728 INFO L168 Benchmark]: TraceAbstraction took 37270.40 ms. Allocated memory was 46.7 MB in the beginning and 75.0 MB in the end (delta: 28.3 MB). Free memory was 18.1 MB in the beginning and 8.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 38.3 MB. Max. memory is 14.3 GB. [2020-10-20 05:59:47,728 INFO L168 Benchmark]: Witness Printer took 3.69 ms. Allocated memory is still 75.0 MB. Free memory is still 8.0 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 05:59:47,730 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 30.9 MB. Free memory was 7.8 MB in the beginning and 7.8 MB in the end (delta: 43.8 kB). Peak memory consumption was 43.8 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 620.30 ms. Allocated memory was 40.9 MB in the beginning and 42.5 MB in the end (delta: 1.6 MB). Free memory was 16.6 MB in the beginning and 16.3 MB in the end (delta: 310.9 kB). Peak memory consumption was 7.3 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 134.07 ms. Allocated memory is still 42.5 MB. Free memory was 16.3 MB in the beginning and 12.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. * RCFGBuilder took 951.71 ms. Allocated memory was 42.5 MB in the beginning and 46.7 MB in the end (delta: 4.2 MB). Free memory was 12.7 MB in the beginning and 18.4 MB in the end (delta: -5.7 MB). Peak memory consumption was 5.3 MB. Max. memory is 14.3 GB. * TraceAbstraction took 37270.40 ms. Allocated memory was 46.7 MB in the beginning and 75.0 MB in the end (delta: 28.3 MB). Free memory was 18.1 MB in the beginning and 8.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 38.3 MB. Max. memory is 14.3 GB. * Witness Printer took 3.69 ms. Allocated memory is still 75.0 MB. Free memory is still 8.0 MB. There was no memory consumed. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L524] int c = 0; [L541] struct item *list = ((void *)0); [L542] int length = 0; [L544] CALL append(&list) [L531] c++ [L532] struct item *item = malloc(sizeof *item); [L533] EXPR \read(**plist) [L533] item->next = *plist [L534] EXPR item->next [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L534-L536] item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L537] *plist = item [L544] RET append(&list) [L545] length++ [L546] COND TRUE __VERIFIER_nondet_int() && c < 20 [L544] CALL append(&list) [L531] c++ [L532] struct item *item = malloc(sizeof *item); [L533] EXPR \read(**plist) [L533] item->next = *plist [L534] EXPR item->next [L534-L536] (item->next) ? item->next->data : malloc(sizeof *item) [L535] EXPR item->next [L535] item->next->data - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 124 locations, 45 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 37.1s, OverallIterations: 12, TraceHistogramMax: 2, AutomataDifference: 24.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 680 SDtfs, 811 SDslu, 2127 SDs, 0 SdLazy, 1747 SolverSat, 102 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 22.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 434 GetRequests, 339 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred 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, 11 MinimizatonAttempts, 132 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 396 ConstructedInterpolants, 15 QuantifiedInterpolants, 62702 SizeOfPredicates, 97 NumberOfNonLiveVariables, 1441 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 4/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: 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...