./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 30f4e4ab 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-ext3-properties/dll_nullified-1.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 573d04c3ab16ffed1ccac6c6179d92b670a825d7 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:48:12,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:48:12,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:48:12,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:48:12,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:48:12,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:48:12,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:48:12,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:48:12,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:48:12,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:48:12,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:48:12,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:48:12,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:48:12,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:48:12,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:48:12,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:48:12,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:48:12,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:48:12,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:48:12,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:48:12,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:48:12,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:48:12,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:48:12,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:48:12,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:48:12,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:48:12,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:48:12,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:48:12,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:48:12,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:48:12,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:48:12,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:48:12,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:48:12,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:48:12,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:48:12,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:48:12,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:48:12,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:48:12,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:48:12,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:48:12,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:48:12,690 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-28 02:48:12,714 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:48:12,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:48:12,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:48:12,718 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:48:12,718 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:48:12,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:48:12,718 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:48:12,719 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:48:12,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:48:12,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:48:12,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:48:12,719 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:48:12,720 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:48:12,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:48:12,720 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:48:12,720 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:48:12,720 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:48:12,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:48:12,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:48:12,722 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:48:12,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:48:12,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:48:12,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:48:12,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:48:12,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:48:12,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:48:12,724 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 -> 573d04c3ab16ffed1ccac6c6179d92b670a825d7 [2019-11-28 02:48:13,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:48:13,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:48:13,046 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:48:13,047 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:48:13,048 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:48:13,049 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2019-11-28 02:48:13,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ad48f256/e648ad963d0d4873bfc1350f073dc391/FLAG2945a789b [2019-11-28 02:48:13,694 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:48:13,694 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2019-11-28 02:48:13,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ad48f256/e648ad963d0d4873bfc1350f073dc391/FLAG2945a789b [2019-11-28 02:48:14,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ad48f256/e648ad963d0d4873bfc1350f073dc391 [2019-11-28 02:48:14,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:48:14,018 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:48:14,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:48:14,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:48:14,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:48:14,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:48:14" (1/1) ... [2019-11-28 02:48:14,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600cef8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:14, skipping insertion in model container [2019-11-28 02:48:14,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:48:14" (1/1) ... [2019-11-28 02:48:14,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:48:14,083 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:48:14,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:48:14,529 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:48:14,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:48:14,635 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:48:14,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:14 WrapperNode [2019-11-28 02:48:14,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:48:14,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:48:14,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:48:14,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:48:14,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:14" (1/1) ... [2019-11-28 02:48:14,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:14" (1/1) ... [2019-11-28 02:48:14,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:14" (1/1) ... [2019-11-28 02:48:14,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:14" (1/1) ... [2019-11-28 02:48:14,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:14" (1/1) ... [2019-11-28 02:48:14,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:14" (1/1) ... [2019-11-28 02:48:14,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:14" (1/1) ... [2019-11-28 02:48:14,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:48:14,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:48:14,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:48:14,715 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:48:14,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:14" (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-28 02:48:14,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:48:14,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:48:14,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 02:48:14,776 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 02:48:14,776 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-28 02:48:14,776 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-11-28 02:48:14,776 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:48:14,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:48:14,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:48:14,777 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 02:48:14,777 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 02:48:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 02:48:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 02:48:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 02:48:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 02:48:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 02:48:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 02:48:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 02:48:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 02:48:14,780 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 02:48:14,780 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 02:48:14,780 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 02:48:14,780 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 02:48:14,780 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 02:48:14,781 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 02:48:14,781 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 02:48:14,781 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 02:48:14,781 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 02:48:14,782 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 02:48:14,782 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 02:48:14,782 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 02:48:14,782 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 02:48:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 02:48:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 02:48:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 02:48:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 02:48:14,784 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 02:48:14,784 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 02:48:14,784 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 02:48:14,784 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 02:48:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 02:48:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 02:48:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 02:48:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 02:48:14,786 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 02:48:14,786 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 02:48:14,786 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 02:48:14,786 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 02:48:14,786 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 02:48:14,787 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 02:48:14,787 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 02:48:14,787 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 02:48:14,787 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 02:48:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 02:48:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 02:48:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 02:48:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 02:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 02:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 02:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 02:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 02:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 02:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 02:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 02:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 02:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-28 02:48:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 02:48:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 02:48:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 02:48:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 02:48:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 02:48:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 02:48:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 02:48:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 02:48:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 02:48:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 02:48:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 02:48:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 02:48:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 02:48:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 02:48:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 02:48:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 02:48:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 02:48:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 02:48:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 02:48:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 02:48:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 02:48:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 02:48:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 02:48:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 02:48:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 02:48:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 02:48:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 02:48:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 02:48:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 02:48:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 02:48:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 02:48:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 02:48:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 02:48:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 02:48:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 02:48:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 02:48:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 02:48:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 02:48:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 02:48:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 02:48:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 02:48:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 02:48:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 02:48:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 02:48:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 02:48:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 02:48:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 02:48:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 02:48:14,801 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-28 02:48:14,801 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-11-28 02:48:14,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 02:48:14,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:48:14,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 02:48:14,802 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:48:14,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 02:48:14,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:48:14,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:48:14,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:48:14,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:48:15,151 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-28 02:48:15,432 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:48:15,432 INFO L297 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-28 02:48:15,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:48:15 BoogieIcfgContainer [2019-11-28 02:48:15,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:48:15,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:48:15,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:48:15,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:48:15,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:48:14" (1/3) ... [2019-11-28 02:48:15,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f07f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:48:15, skipping insertion in model container [2019-11-28 02:48:15,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:14" (2/3) ... [2019-11-28 02:48:15,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f07f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:48:15, skipping insertion in model container [2019-11-28 02:48:15,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:48:15" (3/3) ... [2019-11-28 02:48:15,444 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2019-11-28 02:48:15,454 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:48:15,462 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2019-11-28 02:48:15,476 INFO L249 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2019-11-28 02:48:15,491 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:48:15,492 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:48:15,492 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:48:15,492 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:48:15,492 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:48:15,493 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:48:15,493 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:48:15,493 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:48:15,510 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2019-11-28 02:48:15,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:48:15,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:15,521 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:15,521 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, 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]=== [2019-11-28 02:48:15,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:15,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1636155626, now seen corresponding path program 1 times [2019-11-28 02:48:15,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:15,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127270935] [2019-11-28 02:48:15,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:15,735 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-28 02:48:15,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127270935] [2019-11-28 02:48:15,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:15,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:48:15,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367707189] [2019-11-28 02:48:15,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:48:15,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:15,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:48:15,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:48:15,774 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 4 states. [2019-11-28 02:48:16,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:16,188 INFO L93 Difference]: Finished difference Result 154 states and 172 transitions. [2019-11-28 02:48:16,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:48:16,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 02:48:16,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:16,204 INFO L225 Difference]: With dead ends: 154 [2019-11-28 02:48:16,204 INFO L226 Difference]: Without dead ends: 146 [2019-11-28 02:48:16,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:48:16,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-28 02:48:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2019-11-28 02:48:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-28 02:48:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2019-11-28 02:48:16,258 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 11 [2019-11-28 02:48:16,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:16,259 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2019-11-28 02:48:16,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:48:16,260 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2019-11-28 02:48:16,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:48:16,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:16,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:16,261 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, 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]=== [2019-11-28 02:48:16,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:16,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1636155627, now seen corresponding path program 1 times [2019-11-28 02:48:16,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:16,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932893691] [2019-11-28 02:48:16,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:16,390 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-28 02:48:16,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932893691] [2019-11-28 02:48:16,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:16,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:48:16,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031998836] [2019-11-28 02:48:16,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:48:16,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:16,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:48:16,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:48:16,394 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand 4 states. [2019-11-28 02:48:16,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:16,715 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2019-11-28 02:48:16,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:48:16,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 02:48:16,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:16,719 INFO L225 Difference]: With dead ends: 141 [2019-11-28 02:48:16,719 INFO L226 Difference]: Without dead ends: 141 [2019-11-28 02:48:16,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:48:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-28 02:48:16,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 103. [2019-11-28 02:48:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-28 02:48:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2019-11-28 02:48:16,732 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 11 [2019-11-28 02:48:16,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:16,733 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2019-11-28 02:48:16,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:48:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2019-11-28 02:48:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 02:48:16,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:16,735 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:16,735 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, 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]=== [2019-11-28 02:48:16,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:16,736 INFO L82 PathProgramCache]: Analyzing trace with hash -892508750, now seen corresponding path program 1 times [2019-11-28 02:48:16,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:16,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333169880] [2019-11-28 02:48:16,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:16,877 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-28 02:48:16,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333169880] [2019-11-28 02:48:16,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:16,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:48:16,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308152586] [2019-11-28 02:48:16,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:48:16,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:16,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:48:16,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:48:16,884 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand 7 states. [2019-11-28 02:48:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:17,232 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2019-11-28 02:48:17,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:48:17,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-28 02:48:17,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:17,234 INFO L225 Difference]: With dead ends: 101 [2019-11-28 02:48:17,235 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 02:48:17,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:48:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 02:48:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2019-11-28 02:48:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 02:48:17,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2019-11-28 02:48:17,243 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 14 [2019-11-28 02:48:17,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:17,244 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2019-11-28 02:48:17,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:48:17,244 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2019-11-28 02:48:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:48:17,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:17,246 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:17,246 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, 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]=== [2019-11-28 02:48:17,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:17,247 INFO L82 PathProgramCache]: Analyzing trace with hash 220783085, now seen corresponding path program 1 times [2019-11-28 02:48:17,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:17,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217782371] [2019-11-28 02:48:17,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:17,361 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-28 02:48:17,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217782371] [2019-11-28 02:48:17,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:17,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:48:17,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431610346] [2019-11-28 02:48:17,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:48:17,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:17,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:48:17,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:48:17,366 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 4 states. [2019-11-28 02:48:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:17,521 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-11-28 02:48:17,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:48:17,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-28 02:48:17,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:17,524 INFO L225 Difference]: With dead ends: 95 [2019-11-28 02:48:17,524 INFO L226 Difference]: Without dead ends: 95 [2019-11-28 02:48:17,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:48:17,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-28 02:48:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-11-28 02:48:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-28 02:48:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2019-11-28 02:48:17,532 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 20 [2019-11-28 02:48:17,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:17,533 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2019-11-28 02:48:17,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:48:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2019-11-28 02:48:17,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:48:17,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:17,535 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:17,535 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, 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]=== [2019-11-28 02:48:17,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash -753815674, now seen corresponding path program 1 times [2019-11-28 02:48:17,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:17,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047092240] [2019-11-28 02:48:17,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:17,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047092240] [2019-11-28 02:48:17,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:17,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:48:17,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383250361] [2019-11-28 02:48:17,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:48:17,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:17,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:48:17,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:48:17,709 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 9 states. [2019-11-28 02:48:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:18,166 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2019-11-28 02:48:18,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:48:18,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-11-28 02:48:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:18,167 INFO L225 Difference]: With dead ends: 94 [2019-11-28 02:48:18,168 INFO L226 Difference]: Without dead ends: 94 [2019-11-28 02:48:18,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:48:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-28 02:48:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2019-11-28 02:48:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 02:48:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2019-11-28 02:48:18,174 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 26 [2019-11-28 02:48:18,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:18,174 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2019-11-28 02:48:18,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:48:18,174 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2019-11-28 02:48:18,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:48:18,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:18,175 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:18,176 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, 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]=== [2019-11-28 02:48:18,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:18,176 INFO L82 PathProgramCache]: Analyzing trace with hash -753815673, now seen corresponding path program 1 times [2019-11-28 02:48:18,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:18,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928427959] [2019-11-28 02:48:18,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:18,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928427959] [2019-11-28 02:48:18,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611942501] [2019-11-28 02:48:18,278 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-28 02:48:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:18,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:48:18,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:48:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:18,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:48:18,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-28 02:48:18,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074284871] [2019-11-28 02:48:18,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:48:18,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:18,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:48:18,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:48:18,454 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 9 states. [2019-11-28 02:48:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:18,720 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2019-11-28 02:48:18,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:48:18,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-11-28 02:48:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:18,722 INFO L225 Difference]: With dead ends: 106 [2019-11-28 02:48:18,722 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 02:48:18,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:48:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 02:48:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2019-11-28 02:48:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-28 02:48:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2019-11-28 02:48:18,729 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 26 [2019-11-28 02:48:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:18,729 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2019-11-28 02:48:18,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:48:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2019-11-28 02:48:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 02:48:18,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:18,731 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:18,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:18,935 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, 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]=== [2019-11-28 02:48:18,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:18,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1207663810, now seen corresponding path program 1 times [2019-11-28 02:48:18,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:18,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901356863] [2019-11-28 02:48:18,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:19,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901356863] [2019-11-28 02:48:19,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100075338] [2019-11-28 02:48:19,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:19,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 02:48:19,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:48:19,242 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-28 02:48:19,242 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:19,249 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:19,250 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:19,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 02:48:19,332 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:19,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-28 02:48:19,334 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:19,362 INFO L588 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2019-11-28 02:48:19,362 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:48:19,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:19 [2019-11-28 02:48:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:19,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:48:19,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-28 02:48:19,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848638234] [2019-11-28 02:48:19,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:48:19,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:19,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:48:19,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:48:19,380 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand 8 states. [2019-11-28 02:48:19,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:19,629 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2019-11-28 02:48:19,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:48:19,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-11-28 02:48:19,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:19,631 INFO L225 Difference]: With dead ends: 89 [2019-11-28 02:48:19,631 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 02:48:19,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:48:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 02:48:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-11-28 02:48:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 02:48:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2019-11-28 02:48:19,638 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 32 [2019-11-28 02:48:19,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:19,639 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2019-11-28 02:48:19,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:48:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2019-11-28 02:48:19,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 02:48:19,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:19,641 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:19,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:19,842 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, 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]=== [2019-11-28 02:48:19,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:19,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1991367515, now seen corresponding path program 2 times [2019-11-28 02:48:19,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:19,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084740858] [2019-11-28 02:48:19,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:20,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084740858] [2019-11-28 02:48:20,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096177481] [2019-11-28 02:48:20,024 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:20,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:48:20,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:48:20,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:48:20,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:48:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:20,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:48:20,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-28 02:48:20,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994503399] [2019-11-28 02:48:20,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:48:20,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:20,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:48:20,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:48:20,248 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 12 states. [2019-11-28 02:48:20,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:20,779 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2019-11-28 02:48:20,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:48:20,780 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-28 02:48:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:20,781 INFO L225 Difference]: With dead ends: 117 [2019-11-28 02:48:20,781 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 02:48:20,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-11-28 02:48:20,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 02:48:20,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2019-11-28 02:48:20,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 02:48:20,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2019-11-28 02:48:20,787 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 38 [2019-11-28 02:48:20,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:20,788 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2019-11-28 02:48:20,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:48:20,788 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2019-11-28 02:48:20,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 02:48:20,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:20,790 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:20,993 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:20,994 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, 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]=== [2019-11-28 02:48:20,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:20,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1388539033, now seen corresponding path program 1 times [2019-11-28 02:48:20,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:20,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797275948] [2019-11-28 02:48:20,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:21,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797275948] [2019-11-28 02:48:21,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378686990] [2019-11-28 02:48:21,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:21,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:48:21,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:48:21,522 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:21,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:48:21,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2019-11-28 02:48:21,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596415914] [2019-11-28 02:48:21,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:48:21,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:21,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:48:21,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:48:21,526 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 11 states. [2019-11-28 02:48:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:21,812 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2019-11-28 02:48:21,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:48:21,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-11-28 02:48:21,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:21,814 INFO L225 Difference]: With dead ends: 130 [2019-11-28 02:48:21,814 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 02:48:21,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:48:21,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 02:48:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-28 02:48:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-28 02:48:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2019-11-28 02:48:21,819 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 52 [2019-11-28 02:48:21,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:21,819 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2019-11-28 02:48:21,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:48:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2019-11-28 02:48:21,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-28 02:48:21,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:21,821 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:22,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:22,030 INFO L410 AbstractCegarLoop]: === Iteration 10 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, 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]=== [2019-11-28 02:48:22,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:22,031 INFO L82 PathProgramCache]: Analyzing trace with hash 806592706, now seen corresponding path program 2 times [2019-11-28 02:48:22,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:22,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460195696] [2019-11-28 02:48:22,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:22,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460195696] [2019-11-28 02:48:22,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405478263] [2019-11-28 02:48:22,315 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:22,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:48:22,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:48:22,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:48:22,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:48:22,502 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:22,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:48:22,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2019-11-28 02:48:22,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859253083] [2019-11-28 02:48:22,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:48:22,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:22,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:48:22,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:48:22,506 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 12 states. [2019-11-28 02:48:22,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:22,789 INFO L93 Difference]: Finished difference Result 143 states and 159 transitions. [2019-11-28 02:48:22,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:48:22,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-11-28 02:48:22,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:22,791 INFO L225 Difference]: With dead ends: 143 [2019-11-28 02:48:22,791 INFO L226 Difference]: Without dead ends: 140 [2019-11-28 02:48:22,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:48:22,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-28 02:48:22,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2019-11-28 02:48:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-28 02:48:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2019-11-28 02:48:22,796 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 65 [2019-11-28 02:48:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:22,796 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2019-11-28 02:48:22,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:48:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2019-11-28 02:48:22,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-28 02:48:22,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:22,798 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:23,002 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:23,003 INFO L410 AbstractCegarLoop]: === Iteration 11 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, 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]=== [2019-11-28 02:48:23,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:23,004 INFO L82 PathProgramCache]: Analyzing trace with hash -810524857, now seen corresponding path program 3 times [2019-11-28 02:48:23,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:23,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335929831] [2019-11-28 02:48:23,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-28 02:48:23,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335929831] [2019-11-28 02:48:23,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:23,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:48:23,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869904410] [2019-11-28 02:48:23,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:48:23,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:23,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:48:23,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:48:23,264 INFO L87 Difference]: Start difference. First operand 128 states and 143 transitions. Second operand 9 states. [2019-11-28 02:48:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:23,773 INFO L93 Difference]: Finished difference Result 163 states and 183 transitions. [2019-11-28 02:48:23,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:48:23,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-11-28 02:48:23,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:23,776 INFO L225 Difference]: With dead ends: 163 [2019-11-28 02:48:23,776 INFO L226 Difference]: Without dead ends: 163 [2019-11-28 02:48:23,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:48:23,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-28 02:48:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 154. [2019-11-28 02:48:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 02:48:23,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2019-11-28 02:48:23,782 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 78 [2019-11-28 02:48:23,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:23,783 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2019-11-28 02:48:23,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:48:23,783 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2019-11-28 02:48:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-28 02:48:23,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:23,785 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:23,785 INFO L410 AbstractCegarLoop]: === Iteration 12 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, 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]=== [2019-11-28 02:48:23,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:23,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1237334442, now seen corresponding path program 1 times [2019-11-28 02:48:23,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:23,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711569200] [2019-11-28 02:48:23,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-28 02:48:23,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711569200] [2019-11-28 02:48:23,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:23,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 02:48:23,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875659015] [2019-11-28 02:48:23,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:48:23,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:23,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:48:23,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:48:23,995 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand 9 states. [2019-11-28 02:48:24,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:24,363 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2019-11-28 02:48:24,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:48:24,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-11-28 02:48:24,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:24,365 INFO L225 Difference]: With dead ends: 160 [2019-11-28 02:48:24,365 INFO L226 Difference]: Without dead ends: 160 [2019-11-28 02:48:24,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:48:24,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-28 02:48:24,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2019-11-28 02:48:24,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 02:48:24,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2019-11-28 02:48:24,372 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 82 [2019-11-28 02:48:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:24,373 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2019-11-28 02:48:24,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:48:24,373 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2019-11-28 02:48:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-28 02:48:24,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:24,375 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-28 02:48:24,375 INFO L410 AbstractCegarLoop]: === Iteration 13 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, 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]=== [2019-11-28 02:48:24,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:24,376 INFO L82 PathProgramCache]: Analyzing trace with hash -168861462, now seen corresponding path program 1 times [2019-11-28 02:48:24,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:24,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342540593] [2019-11-28 02:48:24,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-28 02:48:24,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342540593] [2019-11-28 02:48:24,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094520331] [2019-11-28 02:48:24,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:24,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-28 02:48:24,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:48:24,980 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:24,980 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-28 02:48:24,981 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:24,984 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:24,985 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:24,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-28 02:48:25,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 02:48:25,013 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:25,020 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:25,021 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:25,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-28 02:48:25,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:25,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-28 02:48:25,059 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:25,067 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:25,068 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:25,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-28 02:48:25,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:25,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:25,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:25,119 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-11-28 02:48:25,120 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:25,132 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:25,133 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:25,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2019-11-28 02:48:25,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:25,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:25,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:25,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-28 02:48:25,147 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:25,159 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:25,159 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:25,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2019-11-28 02:48:25,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:25,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:25,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:25,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-28 02:48:25,177 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:25,187 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:25,188 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:25,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2019-11-28 02:48:25,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:25,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-28 02:48:25,212 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:25,221 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:25,222 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:25,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:23 [2019-11-28 02:48:25,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:25,379 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:25,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-28 02:48:25,380 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:25,384 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:25,386 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:25,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-11-28 02:48:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-28 02:48:25,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:48:25,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2019-11-28 02:48:25,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265094505] [2019-11-28 02:48:25,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 02:48:25,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:25,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 02:48:25,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-28 02:48:25,400 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand 23 states. [2019-11-28 02:48:26,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:26,524 INFO L93 Difference]: Finished difference Result 160 states and 179 transitions. [2019-11-28 02:48:26,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 02:48:26,525 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2019-11-28 02:48:26,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:26,526 INFO L225 Difference]: With dead ends: 160 [2019-11-28 02:48:26,526 INFO L226 Difference]: Without dead ends: 160 [2019-11-28 02:48:26,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 02:48:26,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-28 02:48:26,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2019-11-28 02:48:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 02:48:26,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 174 transitions. [2019-11-28 02:48:26,533 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 174 transitions. Word has length 86 [2019-11-28 02:48:26,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:26,533 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 174 transitions. [2019-11-28 02:48:26,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 02:48:26,533 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 174 transitions. [2019-11-28 02:48:26,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-28 02:48:26,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:26,534 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:26,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:26,739 INFO L410 AbstractCegarLoop]: === Iteration 14 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, 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]=== [2019-11-28 02:48:26,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:26,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1735285809, now seen corresponding path program 1 times [2019-11-28 02:48:26,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:26,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047351807] [2019-11-28 02:48:26,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-28 02:48:27,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047351807] [2019-11-28 02:48:27,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861223814] [2019-11-28 02:48:27,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:27,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-28 02:48:27,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:48:27,550 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:27,550 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-28 02:48:27,551 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:27,555 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:27,555 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:27,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-28 02:48:27,596 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-28 02:48:27,596 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:27,604 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:27,604 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:27,604 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-28 02:48:27,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:27,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-28 02:48:27,615 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:27,623 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:27,624 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:27,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2019-11-28 02:48:27,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:27,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-28 02:48:27,634 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:27,640 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:27,640 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:27,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2019-11-28 02:48:27,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:27,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-28 02:48:27,653 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:27,659 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:27,659 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:27,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2019-11-28 02:48:27,668 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 29 treesize of output 13 [2019-11-28 02:48:27,669 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:27,675 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:27,678 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:27,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:13 [2019-11-28 02:48:27,722 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-28 02:48:27,723 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:27,725 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:27,725 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:27,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-28 02:48:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-28 02:48:27,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:48:27,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 17 [2019-11-28 02:48:27,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582633147] [2019-11-28 02:48:27,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 02:48:27,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:27,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 02:48:27,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-11-28 02:48:27,746 INFO L87 Difference]: Start difference. First operand 154 states and 174 transitions. Second operand 17 states. [2019-11-28 02:48:28,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:28,576 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2019-11-28 02:48:28,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 02:48:28,577 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2019-11-28 02:48:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:28,579 INFO L225 Difference]: With dead ends: 160 [2019-11-28 02:48:28,579 INFO L226 Difference]: Without dead ends: 160 [2019-11-28 02:48:28,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2019-11-28 02:48:28,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-28 02:48:28,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2019-11-28 02:48:28,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 02:48:28,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2019-11-28 02:48:28,584 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 88 [2019-11-28 02:48:28,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:28,584 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 173 transitions. [2019-11-28 02:48:28,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 02:48:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2019-11-28 02:48:28,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-28 02:48:28,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:28,586 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:28,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:28,790 INFO L410 AbstractCegarLoop]: === Iteration 15 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, 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]=== [2019-11-28 02:48:28,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:28,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1702130661, now seen corresponding path program 1 times [2019-11-28 02:48:28,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:28,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36553542] [2019-11-28 02:48:28,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-28 02:48:29,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36553542] [2019-11-28 02:48:29,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817342750] [2019-11-28 02:48:29,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:29,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-28 02:48:29,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:48:29,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:48:29,408 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:29,409 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 02:48:29,409 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:29,414 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:29,415 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:29,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-11-28 02:48:29,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 02:48:29,475 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:29,490 INFO L588 ElimStorePlain]: treesize reduction 5, result has 82.8 percent of original size [2019-11-28 02:48:29,491 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:29,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:24 [2019-11-28 02:48:29,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:29,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-28 02:48:29,525 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:29,541 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:29,542 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:29,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-11-28 02:48:29,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:29,623 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:29,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 110 [2019-11-28 02:48:29,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:48:29,627 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:29,658 INFO L588 ElimStorePlain]: treesize reduction 46, result has 52.6 percent of original size [2019-11-28 02:48:29,659 INFO L508 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-28 02:48:29,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 [2019-11-28 02:48:29,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:48:29,928 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:29,928 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 53 [2019-11-28 02:48:29,930 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:29,946 INFO L588 ElimStorePlain]: treesize reduction 16, result has 48.4 percent of original size [2019-11-28 02:48:29,947 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:29,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:11 [2019-11-28 02:48:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 79 proven. 12 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 02:48:29,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:48:29,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-11-28 02:48:29,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890228425] [2019-11-28 02:48:29,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-28 02:48:29,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:29,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-28 02:48:29,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2019-11-28 02:48:29,996 INFO L87 Difference]: Start difference. First operand 154 states and 173 transitions. Second operand 29 states. [2019-11-28 02:48:31,171 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-28 02:48:31,555 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-11-28 02:48:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:31,964 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2019-11-28 02:48:31,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 02:48:31,964 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2019-11-28 02:48:31,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:31,966 INFO L225 Difference]: With dead ends: 143 [2019-11-28 02:48:31,966 INFO L226 Difference]: Without dead ends: 143 [2019-11-28 02:48:31,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=279, Invalid=1701, Unknown=0, NotChecked=0, Total=1980 [2019-11-28 02:48:31,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-28 02:48:31,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2019-11-28 02:48:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-28 02:48:31,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 155 transitions. [2019-11-28 02:48:31,971 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 155 transitions. Word has length 89 [2019-11-28 02:48:31,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:31,971 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 155 transitions. [2019-11-28 02:48:31,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-28 02:48:31,971 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 155 transitions. [2019-11-28 02:48:31,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-28 02:48:31,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:31,972 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:32,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:32,177 INFO L410 AbstractCegarLoop]: === Iteration 16 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr22ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, 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]=== [2019-11-28 02:48:32,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:32,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1160774828, now seen corresponding path program 1 times [2019-11-28 02:48:32,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:32,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465335392] [2019-11-28 02:48:32,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:48:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:48:32,357 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:48:32,358 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 02:48:32,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:48:32 BoogieIcfgContainer [2019-11-28 02:48:32,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:48:32,448 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:48:32,449 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:48:32,449 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:48:32,450 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:48:15" (3/4) ... [2019-11-28 02:48:32,452 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 02:48:32,551 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:48:32,551 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:48:32,552 INFO L168 Benchmark]: Toolchain (without parser) took 18534.78 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 408.4 MB). Free memory was 960.4 MB in the beginning and 1.3 GB in the end (delta: -300.6 MB). Peak memory consumption was 107.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:32,552 INFO L168 Benchmark]: CDTParser took 0.26 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-28 02:48:32,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 623.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:32,552 INFO L168 Benchmark]: Boogie Preprocessor took 70.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:48:32,553 INFO L168 Benchmark]: RCFGBuilder took 719.39 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: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:32,553 INFO L168 Benchmark]: TraceAbstraction took 17013.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.5 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:32,553 INFO L168 Benchmark]: Witness Printer took 102.61 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:32,559 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.26 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 623.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 719.39 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: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17013.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.5 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * Witness Printer took 102.61 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 605]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L588] const int len = 5; VAL [len=5] [L589] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L568] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L577] new_head->next = head VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L579] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L577] new_head->next = head VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L580] head->prev = new_head VAL [\old(len)=5, head={-5:0}, len=4, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L577] new_head->next = head VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L580] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L577] new_head->next = head VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L580] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L577] new_head->next = head VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L580] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-1:0}, len=0, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L569] COND FALSE !(len > 0) VAL [\old(len)=5, head={-1:0}, len=0, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L585] return head; VAL [\old(len)=5, \result={-1:0}, head={-1:0}, len=0, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L589] RET, EXPR dll_create(len) VAL [dll_create(len)={-1:0}, len=5] [L589] DLL head = dll_create(len); [L590] head->next VAL [head={-1:0}, head->next={-2:0}, len=5] [L590] COND TRUE head->next [L591] EXPR head->data_0 VAL [head={-1:0}, head->data_0=0, len=5] [L591] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-1:0}, head->data_0=0, len=5] [L591] EXPR head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-1:0}, head->data_0=0, head->data_1=0, len=5] [L591] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-1:0}, head->data_0=0, head->data_1=0, len=5] [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-1:0}, head->data_0=0, head->data_1=0, len=5] [L591] EXPR head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-1:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-1:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L591] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L605] __VERIFIER_error() VAL [head={-1:0}, len=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 106 locations, 35 error locations. Result: UNSAFE, OverallTime: 16.8s, OverallIterations: 16, TraceHistogramMax: 5, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1035 SDtfs, 1333 SDslu, 5224 SDs, 0 SdLazy, 5002 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 729 GetRequests, 497 SyntacticMatches, 20 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 176 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1284 NumberOfCodeBlocks, 1284 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1171 ConstructedInterpolants, 7 QuantifiedInterpolants, 375986 SizeOfPredicates, 59 NumberOfNonLiveVariables, 2446 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 988/1339 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 incorrect! Received shutdown request...