./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f470102c 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/forester-heap/dll-simple-white-blue-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 f369e67185304fce6130a1dfc66e8cb89abf0605 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-11-28 20:20:01,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:20:01,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:20:01,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:20:01,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:20:01,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:20:01,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:20:01,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:20:01,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:20:01,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:20:01,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:20:01,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:20:01,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:20:01,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:20:01,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:20:01,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:20:01,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:20:01,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:20:01,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:20:01,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:20:01,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:20:01,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:20:01,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:20:01,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:20:01,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:20:01,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:20:01,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:20:01,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:20:01,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:20:01,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:20:01,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:20:01,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:20:01,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:20:01,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:20:01,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:20:01,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:20:01,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:20:01,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:20:01,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:20:01,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:20:01,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:20:01,612 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-28 20:20:01,649 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:20:01,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:20:01,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:20:01,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:20:01,653 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:20:01,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:20:01,654 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:20:01,654 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:20:01,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:20:01,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:20:01,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:20:01,656 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:20:01,657 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:20:01,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:20:01,657 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:20:01,658 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:20:01,658 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:20:01,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:20:01,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:20:01,659 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:20:01,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:20:01,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:20:01,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:20:01,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:20:01,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:20:01,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:20:01,661 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:20:01,661 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 -> f369e67185304fce6130a1dfc66e8cb89abf0605 [2019-11-28 20:20:01,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:20:01,991 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:20:01,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:20:02,000 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:20:02,000 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:20:02,001 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i [2019-11-28 20:20:02,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db7483294/4116a69b846b4f778d30218fc5fa2f68/FLAGa097d7bfd [2019-11-28 20:20:02,589 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:20:02,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i [2019-11-28 20:20:02,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db7483294/4116a69b846b4f778d30218fc5fa2f68/FLAGa097d7bfd [2019-11-28 20:20:02,949 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db7483294/4116a69b846b4f778d30218fc5fa2f68 [2019-11-28 20:20:02,952 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:20:02,953 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:20:02,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:20:02,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:20:02,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:20:02,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:02" (1/1) ... [2019-11-28 20:20:02,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604b570b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:02, skipping insertion in model container [2019-11-28 20:20:02,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:02" (1/1) ... [2019-11-28 20:20:02,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:20:03,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:20:03,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:20:03,446 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:20:03,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:20:03,552 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:20:03,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:03 WrapperNode [2019-11-28 20:20:03,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:20:03,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:20:03,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:20:03,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:20:03,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:03" (1/1) ... [2019-11-28 20:20:03,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:03" (1/1) ... [2019-11-28 20:20:03,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:03" (1/1) ... [2019-11-28 20:20:03,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:03" (1/1) ... [2019-11-28 20:20:03,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:03" (1/1) ... [2019-11-28 20:20:03,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:03" (1/1) ... [2019-11-28 20:20:03,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:03" (1/1) ... [2019-11-28 20:20:03,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:20:03,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:20:03,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:20:03,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:20:03,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:03" (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 20:20:03,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:20:03,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:20:03,690 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:20:03,690 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 20:20:03,690 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 20:20:03,691 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 20:20:03,691 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 20:20:03,692 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 20:20:03,692 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 20:20:03,692 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 20:20:03,692 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 20:20:03,693 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 20:20:03,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 20:20:03,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 20:20:03,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 20:20:03,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 20:20:03,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 20:20:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 20:20:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 20:20:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 20:20:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 20:20:03,698 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 20:20:03,698 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 20:20:03,699 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 20:20:03,699 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 20:20:03,699 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 20:20:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 20:20:03,701 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 20:20:03,701 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 20:20:03,701 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 20:20:03,701 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 20:20:03,701 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 20:20:03,701 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 20:20:03,702 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 20:20:03,702 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 20:20:03,702 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 20:20:03,702 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 20:20:03,702 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 20:20:03,702 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 20:20:03,702 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 20:20:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 20:20:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 20:20:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 20:20:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 20:20:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 20:20:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 20:20:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 20:20:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 20:20:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 20:20:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 20:20:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 20:20:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 20:20:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 20:20:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 20:20:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:20:03,705 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 20:20:03,705 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:20:03,705 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-28 20:20:03,705 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 20:20:03,705 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 20:20:03,705 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 20:20:03,705 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 20:20:03,706 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 20:20:03,706 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 20:20:03,706 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 20:20:03,706 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 20:20:03,706 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 20:20:03,706 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 20:20:03,706 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 20:20:03,706 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 20:20:03,707 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 20:20:03,707 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 20:20:03,707 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 20:20:03,707 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 20:20:03,707 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 20:20:03,707 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 20:20:03,707 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 20:20:03,708 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 20:20:03,708 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 20:20:03,708 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 20:20:03,708 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 20:20:03,708 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 20:20:03,708 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 20:20:03,708 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 20:20:03,708 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 20:20:03,709 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 20:20:03,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 20:20:03,709 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 20:20:03,709 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 20:20:03,709 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 20:20:03,709 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 20:20:03,709 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 20:20:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 20:20:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 20:20:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 20:20:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 20:20:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 20:20:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 20:20:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 20:20:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 20:20:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 20:20:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 20:20:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 20:20:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 20:20:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 20:20:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 20:20:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 20:20:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 20:20:03,712 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:20:03,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:20:03,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 20:20:03,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:20:03,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 20:20:03,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:20:03,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:20:03,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:20:03,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:20:04,438 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:20:04,439 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 20:20:04,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:04 BoogieIcfgContainer [2019-11-28 20:20:04,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:20:04,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:20:04,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:20:04,444 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:20:04,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:20:02" (1/3) ... [2019-11-28 20:20:04,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1e1517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:04, skipping insertion in model container [2019-11-28 20:20:04,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:03" (2/3) ... [2019-11-28 20:20:04,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1e1517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:04, skipping insertion in model container [2019-11-28 20:20:04,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:04" (3/3) ... [2019-11-28 20:20:04,448 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-1.i [2019-11-28 20:20:04,459 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:20:04,467 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 61 error locations. [2019-11-28 20:20:04,480 INFO L249 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2019-11-28 20:20:04,502 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:20:04,502 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:20:04,502 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:20:04,502 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:20:04,503 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:20:04,503 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:20:04,503 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:20:04,503 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:20:04,525 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2019-11-28 20:20:04,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 20:20:04,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:04,536 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:04,537 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 20:20:04,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:04,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1597394023, now seen corresponding path program 1 times [2019-11-28 20:20:04,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:04,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549257822] [2019-11-28 20:20:04,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:04,740 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 20:20:04,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549257822] [2019-11-28 20:20:04,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:04,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:20:04,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614152969] [2019-11-28 20:20:04,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:20:04,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:04,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:20:04,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:20:04,780 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 4 states. [2019-11-28 20:20:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:05,258 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2019-11-28 20:20:05,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:20:05,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 20:20:05,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:05,274 INFO L225 Difference]: With dead ends: 156 [2019-11-28 20:20:05,275 INFO L226 Difference]: Without dead ends: 152 [2019-11-28 20:20:05,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:20:05,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-28 20:20:05,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2019-11-28 20:20:05,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-28 20:20:05,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2019-11-28 20:20:05,334 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 7 [2019-11-28 20:20:05,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:05,335 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2019-11-28 20:20:05,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:20:05,335 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2019-11-28 20:20:05,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 20:20:05,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:05,336 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:05,337 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 20:20:05,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:05,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1597394022, now seen corresponding path program 1 times [2019-11-28 20:20:05,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:05,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85930257] [2019-11-28 20:20:05,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:05,439 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 20:20:05,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85930257] [2019-11-28 20:20:05,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:05,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:20:05,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843145019] [2019-11-28 20:20:05,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:20:05,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:05,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:20:05,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:20:05,443 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 4 states. [2019-11-28 20:20:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:05,823 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2019-11-28 20:20:05,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:20:05,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 20:20:05,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:05,826 INFO L225 Difference]: With dead ends: 149 [2019-11-28 20:20:05,826 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 20:20:05,827 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 20:20:05,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 20:20:05,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 120. [2019-11-28 20:20:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 20:20:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2019-11-28 20:20:05,849 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 7 [2019-11-28 20:20:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:05,849 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2019-11-28 20:20:05,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:20:05,852 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2019-11-28 20:20:05,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 20:20:05,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:05,853 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:05,854 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 20:20:05,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:05,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1796456478, now seen corresponding path program 1 times [2019-11-28 20:20:05,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:05,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514678388] [2019-11-28 20:20:05,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:05,973 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 20:20:05,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514678388] [2019-11-28 20:20:05,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:05,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:20:05,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455331392] [2019-11-28 20:20:05,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:20:05,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:05,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:20:05,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:20:05,976 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 5 states. [2019-11-28 20:20:06,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:06,289 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2019-11-28 20:20:06,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:20:06,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 20:20:06,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:06,296 INFO L225 Difference]: With dead ends: 120 [2019-11-28 20:20:06,297 INFO L226 Difference]: Without dead ends: 120 [2019-11-28 20:20:06,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:20:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-28 20:20:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2019-11-28 20:20:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 20:20:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2019-11-28 20:20:06,307 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 13 [2019-11-28 20:20:06,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:06,307 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2019-11-28 20:20:06,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:20:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2019-11-28 20:20:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 20:20:06,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:06,309 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:06,309 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 20:20:06,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:06,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1796456477, now seen corresponding path program 1 times [2019-11-28 20:20:06,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:06,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983454737] [2019-11-28 20:20:06,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:06,403 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 20:20:06,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983454737] [2019-11-28 20:20:06,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:06,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:20:06,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460298952] [2019-11-28 20:20:06,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:20:06,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:06,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:20:06,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:20:06,405 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 5 states. [2019-11-28 20:20:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:06,769 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2019-11-28 20:20:06,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:20:06,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 20:20:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:06,772 INFO L225 Difference]: With dead ends: 144 [2019-11-28 20:20:06,772 INFO L226 Difference]: Without dead ends: 144 [2019-11-28 20:20:06,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:20:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-28 20:20:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 126. [2019-11-28 20:20:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-28 20:20:06,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2019-11-28 20:20:06,783 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 13 [2019-11-28 20:20:06,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:06,783 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2019-11-28 20:20:06,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:20:06,784 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2019-11-28 20:20:06,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:20:06,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:06,786 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:06,787 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 20:20:06,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:06,788 INFO L82 PathProgramCache]: Analyzing trace with hash 182177509, now seen corresponding path program 1 times [2019-11-28 20:20:06,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:06,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413072284] [2019-11-28 20:20:06,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:06,916 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 20:20:06,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413072284] [2019-11-28 20:20:06,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:06,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:20:06,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572198765] [2019-11-28 20:20:06,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:20:06,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:06,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:20:06,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:20:06,926 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand 6 states. [2019-11-28 20:20:07,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:07,445 INFO L93 Difference]: Finished difference Result 206 states and 229 transitions. [2019-11-28 20:20:07,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:20:07,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-28 20:20:07,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:07,448 INFO L225 Difference]: With dead ends: 206 [2019-11-28 20:20:07,448 INFO L226 Difference]: Without dead ends: 206 [2019-11-28 20:20:07,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:20:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-28 20:20:07,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 125. [2019-11-28 20:20:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-28 20:20:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 139 transitions. [2019-11-28 20:20:07,457 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 139 transitions. Word has length 15 [2019-11-28 20:20:07,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:07,457 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 139 transitions. [2019-11-28 20:20:07,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:20:07,458 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 139 transitions. [2019-11-28 20:20:07,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:20:07,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:07,458 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:07,459 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 20:20:07,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:07,459 INFO L82 PathProgramCache]: Analyzing trace with hash 182177510, now seen corresponding path program 1 times [2019-11-28 20:20:07,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:07,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026108475] [2019-11-28 20:20:07,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:07,535 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 20:20:07,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026108475] [2019-11-28 20:20:07,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:07,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:20:07,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108315289] [2019-11-28 20:20:07,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:20:07,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:07,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:20:07,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:20:07,537 INFO L87 Difference]: Start difference. First operand 125 states and 139 transitions. Second operand 6 states. [2019-11-28 20:20:08,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:08,136 INFO L93 Difference]: Finished difference Result 215 states and 239 transitions. [2019-11-28 20:20:08,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:20:08,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-28 20:20:08,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:08,138 INFO L225 Difference]: With dead ends: 215 [2019-11-28 20:20:08,138 INFO L226 Difference]: Without dead ends: 215 [2019-11-28 20:20:08,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-28 20:20:08,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 124. [2019-11-28 20:20:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-28 20:20:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2019-11-28 20:20:08,146 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 15 [2019-11-28 20:20:08,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:08,146 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2019-11-28 20:20:08,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:20:08,146 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2019-11-28 20:20:08,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:20:08,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:08,147 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:08,148 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 20:20:08,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:08,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1998534361, now seen corresponding path program 1 times [2019-11-28 20:20:08,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:08,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015600989] [2019-11-28 20:20:08,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:08,280 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 20:20:08,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015600989] [2019-11-28 20:20:08,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:08,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:20:08,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148233438] [2019-11-28 20:20:08,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:20:08,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:08,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:20:08,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:20:08,283 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand 10 states. [2019-11-28 20:20:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:08,962 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2019-11-28 20:20:08,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:20:08,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-28 20:20:08,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:08,963 INFO L225 Difference]: With dead ends: 128 [2019-11-28 20:20:08,963 INFO L226 Difference]: Without dead ends: 128 [2019-11-28 20:20:08,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:20:08,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-28 20:20:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2019-11-28 20:20:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-28 20:20:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2019-11-28 20:20:08,968 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 19 [2019-11-28 20:20:08,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:08,969 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2019-11-28 20:20:08,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:20:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2019-11-28 20:20:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:20:08,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:08,971 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:08,972 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 20:20:08,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:08,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1998534360, now seen corresponding path program 1 times [2019-11-28 20:20:08,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:08,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010622495] [2019-11-28 20:20:08,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:09,147 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 20:20:09,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010622495] [2019-11-28 20:20:09,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:09,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 20:20:09,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933593663] [2019-11-28 20:20:09,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:20:09,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:09,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:20:09,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:20:09,150 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 11 states. [2019-11-28 20:20:10,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:10,170 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2019-11-28 20:20:10,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 20:20:10,171 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-28 20:20:10,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:10,173 INFO L225 Difference]: With dead ends: 126 [2019-11-28 20:20:10,173 INFO L226 Difference]: Without dead ends: 126 [2019-11-28 20:20:10,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-11-28 20:20:10,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-28 20:20:10,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 111. [2019-11-28 20:20:10,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-28 20:20:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2019-11-28 20:20:10,181 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 19 [2019-11-28 20:20:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:10,182 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2019-11-28 20:20:10,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:20:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2019-11-28 20:20:10,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:20:10,186 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:10,187 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 20:20:10,187 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 20:20:10,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:10,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1021234684, now seen corresponding path program 1 times [2019-11-28 20:20:10,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:10,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466500670] [2019-11-28 20:20:10,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:10,358 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 20:20:10,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466500670] [2019-11-28 20:20:10,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:10,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:20:10,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255202207] [2019-11-28 20:20:10,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:20:10,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:10,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:20:10,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:20:10,370 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 6 states. [2019-11-28 20:20:10,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:10,690 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2019-11-28 20:20:10,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:20:10,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-28 20:20:10,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:10,693 INFO L225 Difference]: With dead ends: 122 [2019-11-28 20:20:10,693 INFO L226 Difference]: Without dead ends: 122 [2019-11-28 20:20:10,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:20:10,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-28 20:20:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2019-11-28 20:20:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-28 20:20:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2019-11-28 20:20:10,700 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 20 [2019-11-28 20:20:10,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:10,700 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2019-11-28 20:20:10,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:20:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2019-11-28 20:20:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:20:10,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:10,705 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:10,705 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 20:20:10,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:10,705 INFO L82 PathProgramCache]: Analyzing trace with hash 617515280, now seen corresponding path program 1 times [2019-11-28 20:20:10,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:10,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158415460] [2019-11-28 20:20:10,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:10,789 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 20:20:10,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158415460] [2019-11-28 20:20:10,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:10,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:20:10,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432847073] [2019-11-28 20:20:10,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:20:10,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:10,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:20:10,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:20:10,792 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand 7 states. [2019-11-28 20:20:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:11,222 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2019-11-28 20:20:11,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:20:11,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-28 20:20:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:11,225 INFO L225 Difference]: With dead ends: 153 [2019-11-28 20:20:11,225 INFO L226 Difference]: Without dead ends: 153 [2019-11-28 20:20:11,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:20:11,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-28 20:20:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 116. [2019-11-28 20:20:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-28 20:20:11,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2019-11-28 20:20:11,230 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 22 [2019-11-28 20:20:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:11,230 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2019-11-28 20:20:11,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:20:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2019-11-28 20:20:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:20:11,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:11,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:11,232 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 20:20:11,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:11,232 INFO L82 PathProgramCache]: Analyzing trace with hash 617515281, now seen corresponding path program 1 times [2019-11-28 20:20:11,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:11,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681947952] [2019-11-28 20:20:11,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:11,310 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 20:20:11,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681947952] [2019-11-28 20:20:11,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:11,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:20:11,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987860947] [2019-11-28 20:20:11,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:20:11,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:11,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:20:11,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:20:11,312 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand 7 states. [2019-11-28 20:20:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:11,738 INFO L93 Difference]: Finished difference Result 159 states and 178 transitions. [2019-11-28 20:20:11,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:20:11,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-28 20:20:11,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:11,741 INFO L225 Difference]: With dead ends: 159 [2019-11-28 20:20:11,741 INFO L226 Difference]: Without dead ends: 159 [2019-11-28 20:20:11,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:20:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-28 20:20:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 113. [2019-11-28 20:20:11,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 20:20:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2019-11-28 20:20:11,746 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 22 [2019-11-28 20:20:11,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:11,746 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-11-28 20:20:11,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:20:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2019-11-28 20:20:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:20:11,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:11,747 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] [2019-11-28 20:20:11,748 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 20:20:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:11,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1393880153, now seen corresponding path program 1 times [2019-11-28 20:20:11,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:11,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802302699] [2019-11-28 20:20:11,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:11,838 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 20:20:11,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802302699] [2019-11-28 20:20:11,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240361840] [2019-11-28 20:20:11,839 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 20:20:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:11,952 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 20:20:11,959 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:20:12,061 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:12,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-28 20:20:12,063 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:12,087 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-28 20:20:12,087 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:12,088 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-11-28 20:20:12,114 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 20:20:12,115 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:12,126 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:12,127 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:12,127 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2019-11-28 20:20:12,168 INFO L343 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-11-28 20:20:12,169 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2019-11-28 20:20:12,170 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:12,178 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:12,178 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:12,179 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-28 20:20:12,238 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-28 20:20:12,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2019-11-28 20:20:12,239 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:12,246 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:12,247 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:20:12,247 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:15 [2019-11-28 20:20:12,306 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 20:20:12,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:20:12,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-11-28 20:20:12,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337036655] [2019-11-28 20:20:12,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 20:20:12,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:12,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:20:12,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:20:12,309 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 14 states. [2019-11-28 20:20:12,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:12,987 INFO L93 Difference]: Finished difference Result 161 states and 176 transitions. [2019-11-28 20:20:12,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 20:20:12,988 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-11-28 20:20:12,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:12,990 INFO L225 Difference]: With dead ends: 161 [2019-11-28 20:20:12,990 INFO L226 Difference]: Without dead ends: 161 [2019-11-28 20:20:12,991 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:20:12,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-28 20:20:13,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 119. [2019-11-28 20:20:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-28 20:20:13,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2019-11-28 20:20:13,011 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 24 [2019-11-28 20:20:13,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:13,013 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2019-11-28 20:20:13,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 20:20:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2019-11-28 20:20:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:20:13,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:13,016 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] [2019-11-28 20:20:13,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:13,223 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 20:20:13,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:13,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1393880154, now seen corresponding path program 1 times [2019-11-28 20:20:13,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:13,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921994155] [2019-11-28 20:20:13,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:13,354 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 20:20:13,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921994155] [2019-11-28 20:20:13,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447676106] [2019-11-28 20:20:13,355 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 20:20:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:13,458 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 20:20:13,462 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:20:13,514 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:13,515 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 20:20:13,516 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:13,525 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:13,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-28 20:20:13,530 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:13,538 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:13,538 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:13,539 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-28 20:20:13,570 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 20:20:13,570 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:13,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:13,591 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 20:20:13,591 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:13,605 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:13,606 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:13,607 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:38 [2019-11-28 20:20:13,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:13,646 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 37 treesize of output 32 [2019-11-28 20:20:13,647 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:13,665 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:13,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:13,673 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 38 treesize of output 33 [2019-11-28 20:20:13,675 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:13,689 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:13,690 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:13,690 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2019-11-28 20:20:13,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:20:13,784 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 0 case distinctions, treesize of input 40 treesize of output 22 [2019-11-28 20:20:13,785 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:13,798 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:13,802 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-28 20:20:13,803 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 37 treesize of output 19 [2019-11-28 20:20:13,804 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:13,812 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:13,813 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:20:13,813 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:22 [2019-11-28 20:20:13,894 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 20:20:13,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:20:13,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-28 20:20:13,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58993458] [2019-11-28 20:20:13,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 20:20:13,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:13,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 20:20:13,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:20:13,897 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 17 states. [2019-11-28 20:20:14,655 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2019-11-28 20:20:15,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:15,609 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2019-11-28 20:20:15,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 20:20:15,610 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-11-28 20:20:15,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:15,613 INFO L225 Difference]: With dead ends: 179 [2019-11-28 20:20:15,613 INFO L226 Difference]: Without dead ends: 179 [2019-11-28 20:20:15,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2019-11-28 20:20:15,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-28 20:20:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 118. [2019-11-28 20:20:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-28 20:20:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2019-11-28 20:20:15,619 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 24 [2019-11-28 20:20:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:15,620 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2019-11-28 20:20:15,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 20:20:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2019-11-28 20:20:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:20:15,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:15,621 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:15,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:15,827 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 20:20:15,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:15,828 INFO L82 PathProgramCache]: Analyzing trace with hash 258980964, now seen corresponding path program 1 times [2019-11-28 20:20:15,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:15,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217958449] [2019-11-28 20:20:15,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:15,965 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 20:20:15,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217958449] [2019-11-28 20:20:15,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:15,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:20:15,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601789264] [2019-11-28 20:20:15,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:20:15,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:15,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:20:15,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:20:15,974 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand 8 states. [2019-11-28 20:20:16,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:16,518 INFO L93 Difference]: Finished difference Result 163 states and 180 transitions. [2019-11-28 20:20:16,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:20:16,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-28 20:20:16,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:16,521 INFO L225 Difference]: With dead ends: 163 [2019-11-28 20:20:16,521 INFO L226 Difference]: Without dead ends: 163 [2019-11-28 20:20:16,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:20:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-28 20:20:16,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 122. [2019-11-28 20:20:16,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 20:20:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2019-11-28 20:20:16,526 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 25 [2019-11-28 20:20:16,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:16,526 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2019-11-28 20:20:16,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:20:16,526 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2019-11-28 20:20:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:20:16,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:16,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:16,527 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 20:20:16,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:16,528 INFO L82 PathProgramCache]: Analyzing trace with hash 258980965, now seen corresponding path program 1 times [2019-11-28 20:20:16,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:16,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308361714] [2019-11-28 20:20:16,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:16,659 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 20:20:16,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308361714] [2019-11-28 20:20:16,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:16,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:20:16,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642182304] [2019-11-28 20:20:16,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:16,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:16,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:16,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:16,661 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand 9 states. [2019-11-28 20:20:17,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:17,368 INFO L93 Difference]: Finished difference Result 185 states and 202 transitions. [2019-11-28 20:20:17,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:20:17,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-28 20:20:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:17,374 INFO L225 Difference]: With dead ends: 185 [2019-11-28 20:20:17,374 INFO L226 Difference]: Without dead ends: 185 [2019-11-28 20:20:17,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:20:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-28 20:20:17,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 124. [2019-11-28 20:20:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-28 20:20:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2019-11-28 20:20:17,380 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 141 transitions. Word has length 25 [2019-11-28 20:20:17,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:17,380 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 141 transitions. [2019-11-28 20:20:17,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:17,381 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2019-11-28 20:20:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:20:17,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:17,382 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:17,382 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 20:20:17,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:17,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1052847383, now seen corresponding path program 1 times [2019-11-28 20:20:17,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:17,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715236740] [2019-11-28 20:20:17,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:17,449 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 20:20:17,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715236740] [2019-11-28 20:20:17,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:17,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:20:17,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528832403] [2019-11-28 20:20:17,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:20:17,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:17,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:20:17,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:20:17,451 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. Second operand 7 states. [2019-11-28 20:20:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:17,843 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2019-11-28 20:20:17,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:20:17,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-28 20:20:17,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:17,846 INFO L225 Difference]: With dead ends: 187 [2019-11-28 20:20:17,846 INFO L226 Difference]: Without dead ends: 187 [2019-11-28 20:20:17,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-28 20:20:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 136. [2019-11-28 20:20:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-28 20:20:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 156 transitions. [2019-11-28 20:20:17,851 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 156 transitions. Word has length 25 [2019-11-28 20:20:17,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:17,851 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 156 transitions. [2019-11-28 20:20:17,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:20:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2019-11-28 20:20:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 20:20:17,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:17,852 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:17,852 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 20:20:17,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:17,853 INFO L82 PathProgramCache]: Analyzing trace with hash -227392695, now seen corresponding path program 1 times [2019-11-28 20:20:17,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:17,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170888146] [2019-11-28 20:20:17,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:20:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:20:17,909 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:20:17,909 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:20:17,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:20:17 BoogieIcfgContainer [2019-11-28 20:20:17,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:20:17,975 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:20:17,975 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:20:17,975 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:20:17,975 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:04" (3/4) ... [2019-11-28 20:20:17,980 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 20:20:18,052 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:20:18,052 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:20:18,056 INFO L168 Benchmark]: Toolchain (without parser) took 15100.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 358.1 MB). Free memory was 961.7 MB in the beginning and 1.3 GB in the end (delta: -366.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:20:18,056 INFO L168 Benchmark]: CDTParser took 0.60 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 20:20:18,060 INFO L168 Benchmark]: CACSL2BoogieTranslator took 598.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:18,060 INFO L168 Benchmark]: Boogie Preprocessor took 75.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:18,061 INFO L168 Benchmark]: RCFGBuilder took 810.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.2 MB). Peak memory consumption was 65.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:18,061 INFO L168 Benchmark]: TraceAbstraction took 13533.17 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -299.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:20:18,065 INFO L168 Benchmark]: Witness Printer took 77.47 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: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:18,067 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.60 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 598.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 810.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.2 MB). Peak memory consumption was 65.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13533.17 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -299.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 77.47 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: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1052]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L989] SLL* head = malloc(sizeof(SLL)); VAL [head={6:0}, malloc(sizeof(SLL))={6:0}] [L990] head->next = ((void*)0) VAL [head={6:0}, malloc(sizeof(SLL))={6:0}] [L991] head->prev = ((void*)0) VAL [head={6:0}, malloc(sizeof(SLL))={6:0}] [L992] head->data = 0 VAL [head={6:0}, malloc(sizeof(SLL))={6:0}] [L994] SLL* x = head; VAL [head={6:0}, malloc(sizeof(SLL))={6:0}, x={6:0}] [L997] COND FALSE !(__VERIFIER_nondet_int()) [L1008] COND TRUE __VERIFIER_nondet_int() [L1009] x = malloc(sizeof(SLL)) VAL [head={6:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={6:0}, x={5:0}] [L1010] x->data = 1 VAL [head={6:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={6:0}, x={5:0}] [L1011] x->next = head VAL [head={6:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={6:0}, x={5:0}] [L1012] x->prev = ((void*)0) VAL [head={6:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={6:0}, x={5:0}] [L1013] head = x VAL [head={5:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={6:0}, x={5:0}] [L1039] x = head VAL [head={5:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={6:0}, x={5:0}] [L1042] EXPR x->data VAL [head={5:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={6:0}, x={5:0}, x->data=1] [L1042] COND FALSE !(x->data != 1) [L1048] EXPR x->next VAL [head={5:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={6:0}, x={5:0}, x->next={6:0}] [L1048] x = x->next [L1049] COND TRUE \read(*x) VAL [head={5:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={6:0}, x={6:0}] [L1051] EXPR x->data VAL [head={5:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={6:0}, x={6:0}, x->data=0] [L1051] COND TRUE x->data != 1 [L1052] __VERIFIER_error() VAL [head={5:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={6:0}, x={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 61 error locations. Result: UNSAFE, OverallTime: 13.4s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1219 SDtfs, 2674 SDslu, 2471 SDs, 0 SdLazy, 7033 SolverSat, 421 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 77 SyntacticMatches, 10 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 620 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 370 NumberOfCodeBlocks, 370 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 325 ConstructedInterpolants, 4 QuantifiedInterpolants, 57540 SizeOfPredicates, 20 NumberOfNonLiveVariables, 274 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 1/5 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...