./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext-properties/simple-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 5a079682 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/simple-ext.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-5a07968 [2019-11-22 11:21:46,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 11:21:46,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 11:21:46,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 11:21:46,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 11:21:46,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 11:21:46,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 11:21:46,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 11:21:46,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 11:21:46,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 11:21:46,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 11:21:46,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 11:21:46,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 11:21:46,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 11:21:46,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 11:21:46,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 11:21:46,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 11:21:46,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 11:21:46,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 11:21:46,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 11:21:46,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 11:21:46,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 11:21:46,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 11:21:46,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 11:21:46,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 11:21:46,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 11:21:46,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 11:21:46,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 11:21:46,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 11:21:46,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 11:21:46,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 11:21:46,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 11:21:46,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 11:21:46,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 11:21:46,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 11:21:46,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 11:21:46,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 11:21:46,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 11:21:46,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 11:21:46,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 11:21:46,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 11:21:46,696 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-22 11:21:46,719 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 11:21:46,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 11:21:46,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 11:21:46,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 11:21:46,721 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 11:21:46,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 11:21:46,723 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 11:21:46,726 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 11:21:46,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 11:21:46,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 11:21:46,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 11:21:46,728 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 11:21:46,728 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 11:21:46,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 11:21:46,728 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 11:21:46,728 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 11:21:46,729 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 11:21:46,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 11:21:46,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 11:21:46,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 11:21:46,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 11:21:46,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:21:46,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 11:21:46,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 11:21:46,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 11:21:46,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 11:21:46,731 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 [2019-11-22 11:21:47,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 11:21:47,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 11:21:47,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 11:21:47,034 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 11:21:47,034 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 11:21:47,035 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-22 11:21:47,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ceb3b407/6e5f36f1731a4ea3b1f499e4502fadf5/FLAG6382d4984 [2019-11-22 11:21:47,632 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 11:21:47,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-22 11:21:47,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ceb3b407/6e5f36f1731a4ea3b1f499e4502fadf5/FLAG6382d4984 [2019-11-22 11:21:47,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ceb3b407/6e5f36f1731a4ea3b1f499e4502fadf5 [2019-11-22 11:21:47,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 11:21:47,983 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 11:21:47,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 11:21:47,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 11:21:47,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 11:21:47,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:21:47" (1/1) ... [2019-11-22 11:21:47,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c698e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:47, skipping insertion in model container [2019-11-22 11:21:47,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:21:47" (1/1) ... [2019-11-22 11:21:48,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 11:21:48,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 11:21:48,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:21:48,486 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 11:21:48,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:21:48,620 INFO L208 MainTranslator]: Completed translation [2019-11-22 11:21:48,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:48 WrapperNode [2019-11-22 11:21:48,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 11:21:48,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 11:21:48,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 11:21:48,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 11:21:48,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:48" (1/1) ... [2019-11-22 11:21:48,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:48" (1/1) ... [2019-11-22 11:21:48,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:48" (1/1) ... [2019-11-22 11:21:48,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:48" (1/1) ... [2019-11-22 11:21:48,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:48" (1/1) ... [2019-11-22 11:21:48,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:48" (1/1) ... [2019-11-22 11:21:48,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:48" (1/1) ... [2019-11-22 11:21:48,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 11:21:48,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 11:21:48,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 11:21:48,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 11:21:48,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:21:48,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 11:21:48,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 11:21:48,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 11:21:48,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 11:21:48,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-22 11:21:48,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-22 11:21:48,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-22 11:21:48,749 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-22 11:21:48,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 11:21:48,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 11:21:48,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 11:21:48,750 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 11:21:48,750 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 11:21:48,750 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 11:21:48,751 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 11:21:48,751 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 11:21:48,751 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 11:21:48,751 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 11:21:48,751 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 11:21:48,751 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 11:21:48,751 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 11:21:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 11:21:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 11:21:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 11:21:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 11:21:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 11:21:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 11:21:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 11:21:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 11:21:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-22 11:21:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-22 11:21:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-22 11:21:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 11:21:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 11:21:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 11:21:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 11:21:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 11:21:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 11:21:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 11:21:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 11:21:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 11:21:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 11:21:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 11:21:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 11:21:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 11:21:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 11:21:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 11:21:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 11:21:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 11:21:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 11:21:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 11:21:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 11:21:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 11:21:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 11:21:48,757 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 11:21:48,757 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 11:21:48,757 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 11:21:48,757 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 11:21:48,757 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 11:21:48,757 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 11:21:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 11:21:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 11:21:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 11:21:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 11:21:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 11:21:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 11:21:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 11:21:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 11:21:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 11:21:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 11:21:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 11:21:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 11:21:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 11:21:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 11:21:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 11:21:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 11:21:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 11:21:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 11:21:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 11:21:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 11:21:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 11:21:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 11:21:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 11:21:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 11:21:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 11:21:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 11:21:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 11:21:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 11:21:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 11:21:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 11:21:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 11:21:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 11:21:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 11:21:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 11:21:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 11:21:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 11:21:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 11:21:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 11:21:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 11:21:48,764 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 11:21:48,764 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 11:21:48,764 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 11:21:48,764 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 11:21:48,764 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 11:21:48,764 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 11:21:48,765 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 11:21:48,765 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 11:21:48,765 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 11:21:48,765 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 11:21:48,765 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 11:21:48,765 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 11:21:48,765 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 11:21:48,766 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 11:21:48,766 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 11:21:48,766 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 11:21:48,766 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 11:21:48,766 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 11:21:48,766 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 11:21:48,767 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-22 11:21:48,767 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 11:21:48,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 11:21:48,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 11:21:48,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 11:21:48,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 11:21:48,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 11:21:48,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 11:21:48,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 11:21:48,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 11:21:49,124 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-22 11:21:49,402 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 11:21:49,402 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-22 11:21:49,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:21:49 BoogieIcfgContainer [2019-11-22 11:21:49,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 11:21:49,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 11:21:49,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 11:21:49,408 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 11:21:49,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:21:47" (1/3) ... [2019-11-22 11:21:49,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbba8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:21:49, skipping insertion in model container [2019-11-22 11:21:49,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:48" (2/3) ... [2019-11-22 11:21:49,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbba8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:21:49, skipping insertion in model container [2019-11-22 11:21:49,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:21:49" (3/3) ... [2019-11-22 11:21:49,412 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-ext.i [2019-11-22 11:21:49,421 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 11:21:49,429 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-22 11:21:49,441 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-22 11:21:49,461 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 11:21:49,461 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 11:21:49,462 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 11:21:49,462 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 11:21:49,462 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 11:21:49,462 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 11:21:49,462 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 11:21:49,463 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 11:21:49,480 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-11-22 11:21:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 11:21:49,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:49,490 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:49,491 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 11:21:49,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:49,497 INFO L82 PathProgramCache]: Analyzing trace with hash -746638641, now seen corresponding path program 1 times [2019-11-22 11:21:49,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:49,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877308487] [2019-11-22 11:21:49,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:49,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877308487] [2019-11-22 11:21:49,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:49,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 11:21:49,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794221102] [2019-11-22 11:21:49,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 11:21:49,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:49,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 11:21:49,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 11:21:49,692 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2019-11-22 11:21:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:49,875 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-11-22 11:21:49,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 11:21:49,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-22 11:21:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:49,886 INFO L225 Difference]: With dead ends: 62 [2019-11-22 11:21:49,887 INFO L226 Difference]: Without dead ends: 54 [2019-11-22 11:21:49,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 11:21:49,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-22 11:21:49,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-22 11:21:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-22 11:21:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-22 11:21:49,933 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 10 [2019-11-22 11:21:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:49,933 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-22 11:21:49,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 11:21:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-22 11:21:49,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 11:21:49,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:49,935 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:49,935 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 11:21:49,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:49,936 INFO L82 PathProgramCache]: Analyzing trace with hash -261147736, now seen corresponding path program 1 times [2019-11-22 11:21:49,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:49,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708288971] [2019-11-22 11:21:49,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:50,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:50,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708288971] [2019-11-22 11:21:50,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:50,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 11:21:50,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734861399] [2019-11-22 11:21:50,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 11:21:50,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:50,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 11:21:50,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 11:21:50,064 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 5 states. [2019-11-22 11:21:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:50,297 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-11-22 11:21:50,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 11:21:50,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-22 11:21:50,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:50,300 INFO L225 Difference]: With dead ends: 72 [2019-11-22 11:21:50,300 INFO L226 Difference]: Without dead ends: 72 [2019-11-22 11:21:50,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:21:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-22 11:21:50,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2019-11-22 11:21:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-22 11:21:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-11-22 11:21:50,311 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 12 [2019-11-22 11:21:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:50,312 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-11-22 11:21:50,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 11:21:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-11-22 11:21:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 11:21:50,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:50,313 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:50,314 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 11:21:50,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:50,315 INFO L82 PathProgramCache]: Analyzing trace with hash -261147735, now seen corresponding path program 1 times [2019-11-22 11:21:50,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:50,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329941226] [2019-11-22 11:21:50,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:50,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329941226] [2019-11-22 11:21:50,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:50,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 11:21:50,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87402860] [2019-11-22 11:21:50,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 11:21:50,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:50,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 11:21:50,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 11:21:50,419 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 5 states. [2019-11-22 11:21:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:50,647 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-11-22 11:21:50,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:21:50,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-22 11:21:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:50,651 INFO L225 Difference]: With dead ends: 77 [2019-11-22 11:21:50,651 INFO L226 Difference]: Without dead ends: 77 [2019-11-22 11:21:50,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:21:50,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-22 11:21:50,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2019-11-22 11:21:50,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-22 11:21:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2019-11-22 11:21:50,673 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 12 [2019-11-22 11:21:50,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:50,673 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2019-11-22 11:21:50,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 11:21:50,674 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2019-11-22 11:21:50,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 11:21:50,675 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:50,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:50,677 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 11:21:50,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:50,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1733653831, now seen corresponding path program 1 times [2019-11-22 11:21:50,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:50,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091585522] [2019-11-22 11:21:50,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:50,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091585522] [2019-11-22 11:21:50,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:50,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:21:50,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304407714] [2019-11-22 11:21:50,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:21:50,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:50,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:21:50,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:21:50,828 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 6 states. [2019-11-22 11:21:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:50,991 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-11-22 11:21:50,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:21:50,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-22 11:21:50,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:50,993 INFO L225 Difference]: With dead ends: 73 [2019-11-22 11:21:50,993 INFO L226 Difference]: Without dead ends: 73 [2019-11-22 11:21:50,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:21:50,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-22 11:21:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2019-11-22 11:21:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-22 11:21:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2019-11-22 11:21:51,002 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 19 [2019-11-22 11:21:51,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:51,003 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2019-11-22 11:21:51,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:21:51,003 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2019-11-22 11:21:51,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 11:21:51,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:51,004 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:51,005 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 11:21:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:51,005 INFO L82 PathProgramCache]: Analyzing trace with hash 838007822, now seen corresponding path program 1 times [2019-11-22 11:21:51,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:51,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635033011] [2019-11-22 11:21:51,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:51,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635033011] [2019-11-22 11:21:51,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:51,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 11:21:51,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725152296] [2019-11-22 11:21:51,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:21:51,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:51,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:21:51,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:21:51,209 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 8 states. [2019-11-22 11:21:51,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:51,513 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-11-22 11:21:51,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 11:21:51,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-22 11:21:51,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:51,515 INFO L225 Difference]: With dead ends: 82 [2019-11-22 11:21:51,516 INFO L226 Difference]: Without dead ends: 76 [2019-11-22 11:21:51,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:21:51,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-22 11:21:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-11-22 11:21:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-22 11:21:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-22 11:21:51,523 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 21 [2019-11-22 11:21:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:51,524 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-22 11:21:51,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:21:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-22 11:21:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 11:21:51,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:51,526 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:51,526 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 11:21:51,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:51,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2032942662, now seen corresponding path program 1 times [2019-11-22 11:21:51,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:51,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855687682] [2019-11-22 11:21:51,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:51,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855687682] [2019-11-22 11:21:51,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:51,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:21:51,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024181010] [2019-11-22 11:21:51,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:21:51,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:51,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:21:51,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:21:51,652 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2019-11-22 11:21:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:51,853 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-11-22 11:21:51,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 11:21:51,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-22 11:21:51,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:51,854 INFO L225 Difference]: With dead ends: 66 [2019-11-22 11:21:51,854 INFO L226 Difference]: Without dead ends: 66 [2019-11-22 11:21:51,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:21:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-22 11:21:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-11-22 11:21:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-22 11:21:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-22 11:21:51,861 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 21 [2019-11-22 11:21:51,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:51,862 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-22 11:21:51,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:21:51,862 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-22 11:21:51,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 11:21:51,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:51,864 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:51,864 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 11:21:51,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:51,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2032942661, now seen corresponding path program 1 times [2019-11-22 11:21:51,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:51,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652088577] [2019-11-22 11:21:51,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:52,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652088577] [2019-11-22 11:21:52,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:52,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:21:52,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967817548] [2019-11-22 11:21:52,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:21:52,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:52,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:21:52,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:21:52,014 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 7 states. [2019-11-22 11:21:52,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:52,345 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-11-22 11:21:52,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:21:52,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-22 11:21:52,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:52,347 INFO L225 Difference]: With dead ends: 59 [2019-11-22 11:21:52,347 INFO L226 Difference]: Without dead ends: 59 [2019-11-22 11:21:52,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-22 11:21:52,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-22 11:21:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-11-22 11:21:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-22 11:21:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-22 11:21:52,352 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 21 [2019-11-22 11:21:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:52,352 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-22 11:21:52,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:21:52,352 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-11-22 11:21:52,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-22 11:21:52,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:52,353 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:52,354 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 11:21:52,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:52,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1979195964, now seen corresponding path program 1 times [2019-11-22 11:21:52,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:52,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894216154] [2019-11-22 11:21:52,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:52,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:52,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894216154] [2019-11-22 11:21:52,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545185306] [2019-11-22 11:21:52,571 INFO L94 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 [2019-11-22 11:21:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:52,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-22 11:21:52,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:21:52,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 11:21:52,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:52,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:52,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:21:52,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 11:21:52,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-22 11:21:52,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:52,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:52,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:21:52,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-22 11:21:52,864 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:52,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 11:21:52,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:52,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:52,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:21:52,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-11-22 11:21:52,913 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_14|], 2=[|v_#memory_int_13|]} [2019-11-22 11:21:52,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 11:21:52,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:52,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:52,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:21:52,945 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-22 11:21:52,946 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:52,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:52,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:21:52,959 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2019-11-22 11:21:52,995 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-22 11:21:52,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:53,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:53,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:21:53,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2019-11-22 11:21:53,073 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-22 11:21:53,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:53,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:53,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:21:53,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2019-11-22 11:21:53,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-22 11:21:53,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:53,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:53,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:21:53,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:14 [2019-11-22 11:21:53,164 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-22 11:21:53,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:53,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:53,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:21:53,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-11-22 11:21:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:53,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:21:53,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-22 11:21:53,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317833871] [2019-11-22 11:21:53,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-22 11:21:53,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:53,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-22 11:21:53,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2019-11-22 11:21:53,198 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 22 states. [2019-11-22 11:21:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:53,865 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2019-11-22 11:21:53,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 11:21:53,865 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-11-22 11:21:53,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:53,866 INFO L225 Difference]: With dead ends: 83 [2019-11-22 11:21:53,866 INFO L226 Difference]: Without dead ends: 77 [2019-11-22 11:21:53,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-11-22 11:21:53,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-22 11:21:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2019-11-22 11:21:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-22 11:21:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-11-22 11:21:53,872 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 30 [2019-11-22 11:21:53,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:53,872 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-11-22 11:21:53,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-22 11:21:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-11-22 11:21:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-22 11:21:53,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:53,873 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:54,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:21:54,082 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 11:21:54,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:54,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1282404402, now seen corresponding path program 2 times [2019-11-22 11:21:54,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:54,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117596875] [2019-11-22 11:21:54,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:54,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117596875] [2019-11-22 11:21:54,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251173378] [2019-11-22 11:21:54,393 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-11-22 11:21:54,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-22 11:21:54,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-22 11:21:54,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-22 11:21:54,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:21:54,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 11:21:54,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:54,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:54,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:21:54,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 11:21:54,646 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:54,646 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 11:21:54,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:54,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:54,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:21:54,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-22 11:21:54,695 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 11:21:54,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:54,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:54,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:21:54,711 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2019-11-22 11:21:54,855 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-22 11:21:54,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2019-11-22 11:21:54,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:54,880 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-22 11:21:54,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:21:54,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2019-11-22 11:21:54,922 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:54,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 11:21:54,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:54,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:54,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:21:54,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2019-11-22 11:21:54,989 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:54,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 60 [2019-11-22 11:21:54,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:55,024 INFO L567 ElimStorePlain]: treesize reduction 34, result has 50.7 percent of original size [2019-11-22 11:21:55,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:21:55,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:32 [2019-11-22 11:21:55,329 INFO L343 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-11-22 11:21:55,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 74 [2019-11-22 11:21:55,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:21:55,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:21:55,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,339 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 11:21:55,387 INFO L567 ElimStorePlain]: treesize reduction 26, result has 63.4 percent of original size [2019-11-22 11:21:55,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 11:21:55,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:54 [2019-11-22 11:21:55,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,485 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:55,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 68 [2019-11-22 11:21:55,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:21:55,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:55,559 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:55,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 134 [2019-11-22 11:21:55,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:21:55,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:21:55,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:21:55,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,600 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:55,741 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2019-11-22 11:21:55,742 INFO L567 ElimStorePlain]: treesize reduction 1285, result has 7.4 percent of original size [2019-11-22 11:21:55,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-22 11:21:55,744 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:129, output treesize:103 [2019-11-22 11:21:55,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:21:55,950 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[v_prenex_4]} [2019-11-22 11:21:55,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:55,960 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2019-11-22 11:21:55,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:56,004 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.1 percent of original size [2019-11-22 11:21:56,027 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:21:56,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 70 [2019-11-22 11:21:56,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:21:56,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:21:56,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:21:56,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:21:56,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:21:56,034 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:21:56,060 INFO L567 ElimStorePlain]: treesize reduction 83, result has 20.2 percent of original size [2019-11-22 11:21:56,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:21:56,062 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:97, output treesize:5 [2019-11-22 11:21:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:56,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:21:56,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2019-11-22 11:21:56,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976089370] [2019-11-22 11:21:56,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-22 11:21:56,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:56,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-22 11:21:56,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2019-11-22 11:21:56,130 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 31 states. [2019-11-22 11:21:57,485 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-11-22 11:21:57,682 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-11-22 11:21:57,989 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-11-22 11:21:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:58,484 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-11-22 11:21:58,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-22 11:21:58,485 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 39 [2019-11-22 11:21:58,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:58,486 INFO L225 Difference]: With dead ends: 56 [2019-11-22 11:21:58,486 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 11:21:58,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=391, Invalid=2261, Unknown=0, NotChecked=0, Total=2652 [2019-11-22 11:21:58,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 11:21:58,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 11:21:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 11:21:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 11:21:58,488 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-11-22 11:21:58,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:58,489 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 11:21:58,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-22 11:21:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 11:21:58,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 11:21:58,690 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:21:58,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:21:58 BoogieIcfgContainer [2019-11-22 11:21:58,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 11:21:58,697 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 11:21:58,697 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 11:21:58,697 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 11:21:58,698 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:21:49" (3/4) ... [2019-11-22 11:21:58,702 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 11:21:58,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 11:21:58,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-22 11:21:58,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-22 11:21:58,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-22 11:21:58,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-22 11:21:58,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-22 11:21:58,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 11:21:58,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-22 11:21:58,730 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-22 11:21:58,730 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-22 11:21:58,730 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 11:21:58,731 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 11:21:58,791 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 11:21:58,792 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 11:21:58,793 INFO L168 Benchmark]: Toolchain (without parser) took 10810.96 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.2 MB). Free memory was 959.0 MB in the beginning and 843.7 MB in the end (delta: 115.3 MB). Peak memory consumption was 410.5 MB. Max. memory is 11.5 GB. [2019-11-22 11:21:58,794 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 11:21:58,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 637.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-22 11:21:58,798 INFO L168 Benchmark]: Boogie Preprocessor took 68.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-22 11:21:58,799 INFO L168 Benchmark]: RCFGBuilder took 713.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. [2019-11-22 11:21:58,799 INFO L168 Benchmark]: TraceAbstraction took 9291.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.1 GB in the beginning and 852.7 MB in the end (delta: 215.2 MB). Peak memory consumption was 362.5 MB. Max. memory is 11.5 GB. [2019-11-22 11:21:58,800 INFO L168 Benchmark]: Witness Printer took 94.85 ms. Allocated memory is still 1.3 GB. Free memory was 852.7 MB in the beginning and 843.7 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-11-22 11:21:58,803 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 637.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 713.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9291.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.1 GB in the beginning and 852.7 MB in the end (delta: 215.2 MB). Peak memory consumption was 362.5 MB. Max. memory is 11.5 GB. * Witness Printer took 94.85 ms. Allocated memory is still 1.3 GB. Free memory was 852.7 MB in the beginning and 843.7 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 548]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 78 locations, 20 error locations. Result: SAFE, OverallTime: 9.2s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 290 SDtfs, 679 SDslu, 919 SDs, 0 SdLazy, 1964 SolverSat, 210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 65 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 243 ConstructedInterpolants, 11 QuantifiedInterpolants, 93365 SizeOfPredicates, 33 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 14/52 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...