./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 91b1670e Calling Ultimate with: 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 /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: 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 /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 22:45:46,689 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:45:46,691 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:45:46,710 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:45:46,711 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:45:46,712 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:45:46,713 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:45:46,715 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:45:46,717 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:45:46,718 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:45:46,719 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:45:46,719 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:45:46,721 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:45:46,722 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:45:46,723 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:45:46,724 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:45:46,725 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:45:46,727 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:45:46,729 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:45:46,731 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:45:46,732 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:45:46,734 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:45:46,736 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:45:46,737 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:45:46,737 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:45:46,738 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:45:46,739 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:45:46,740 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:45:46,741 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:45:46,743 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:45:46,743 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:45:46,743 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:45:46,744 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:45:46,744 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:45:46,745 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:45:46,746 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:45:46,746 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 22:45:46,772 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:45:46,778 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:45:46,779 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:45:46,779 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:45:46,781 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:45:46,781 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:45:46,782 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:45:46,782 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:45:46,782 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:45:46,782 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:45:46,782 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:45:46,782 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:45:46,783 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:45:46,783 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:45:46,783 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:45:46,783 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:45:46,783 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:45:46,783 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:45:46,787 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:45:46,787 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:45:46,787 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:45:46,788 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:45:46,788 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:45:46,788 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:45:46,788 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:45:46,788 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:45:46,788 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:45:46,789 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:45:46,789 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 [2018-11-28 22:45:46,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:45:46,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:45:46,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:45:46,881 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:45:46,881 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:45:46,883 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.i [2018-11-28 22:45:46,947 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0f698955/8351fa23984042c5bdefb514af7a2465/FLAG70b36cf88 [2018-11-28 22:45:47,410 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:45:47,413 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.i [2018-11-28 22:45:47,426 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0f698955/8351fa23984042c5bdefb514af7a2465/FLAG70b36cf88 [2018-11-28 22:45:47,725 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0f698955/8351fa23984042c5bdefb514af7a2465 [2018-11-28 22:45:47,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:45:47,730 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:45:47,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:45:47,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:45:47,739 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:45:47,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:45:47" (1/1) ... [2018-11-28 22:45:47,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a77845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:45:47, skipping insertion in model container [2018-11-28 22:45:47,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:45:47" (1/1) ... [2018-11-28 22:45:47,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:45:47,791 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:45:48,162 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:45:48,176 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:45:48,241 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:45:48,399 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:45:48,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:45:48 WrapperNode [2018-11-28 22:45:48,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:45:48,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:45:48,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:45:48,402 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:45:48,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:45:48" (1/1) ... [2018-11-28 22:45:48,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:45:48" (1/1) ... [2018-11-28 22:45:48,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:45:48" (1/1) ... [2018-11-28 22:45:48,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:45:48" (1/1) ... [2018-11-28 22:45:48,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:45:48" (1/1) ... [2018-11-28 22:45:48,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:45:48" (1/1) ... [2018-11-28 22:45:48,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:45:48" (1/1) ... [2018-11-28 22:45:48,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:45:48,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:45:48,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:45:48,470 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:45:48,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:45:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:45:48,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:45:48,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:45:48,542 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-28 22:45:48,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:45:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 22:45:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:45:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:45:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:45:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:45:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:45:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:45:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:45:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:45:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:45:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:45:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:45:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:45:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:45:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:45:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:45:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:45:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:45:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:45:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:45:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:45:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:45:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:45:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:45:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:45:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:45:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:45:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:45:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:45:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:45:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:45:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:45:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:45:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:45:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:45:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:45:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:45:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:45:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:45:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:45:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:45:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:45:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:45:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:45:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:45:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:45:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:45:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:45:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:45:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:45:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:45:48,555 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:45:48,555 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:45:48,555 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:45:48,555 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:45:48,555 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:45:48,555 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:45:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:45:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:45:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:45:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:45:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:45:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:45:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:45:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:45:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 22:45:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:45:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:45:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:45:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:45:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:45:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:45:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:45:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:45:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:45:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:45:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:45:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:45:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:45:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:45:48,562 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:45:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:45:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:45:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:45:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:45:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:45:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:45:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:45:48,564 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:45:48,564 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:45:48,564 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:45:48,567 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:45:48,567 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:45:48,568 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:45:48,568 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:45:48,568 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:45:48,568 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:45:48,568 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:45:48,568 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:45:48,568 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:45:48,568 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:45:48,568 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:45:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 22:45:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-28 22:45:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:45:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 22:45:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 22:45:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:45:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 22:45:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:45:48,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:45:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:45:49,578 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:45:49,578 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 22:45:49,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:45:49 BoogieIcfgContainer [2018-11-28 22:45:49,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:45:49,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:45:49,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:45:49,584 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:45:49,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:45:47" (1/3) ... [2018-11-28 22:45:49,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d4c43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:45:49, skipping insertion in model container [2018-11-28 22:45:49,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:45:48" (2/3) ... [2018-11-28 22:45:49,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d4c43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:45:49, skipping insertion in model container [2018-11-28 22:45:49,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:45:49" (3/3) ... [2018-11-28 22:45:49,587 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-11-28 22:45:49,598 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:45:49,606 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-11-28 22:45:49,625 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-11-28 22:45:49,650 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:45:49,651 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:45:49,651 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:45:49,651 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:45:49,651 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:45:49,651 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:45:49,652 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:45:49,652 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:45:49,652 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:45:49,670 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-11-28 22:45:49,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 22:45:49,680 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:49,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:45:49,683 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION]=== [2018-11-28 22:45:49,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:49,689 INFO L82 PathProgramCache]: Analyzing trace with hash -557279662, now seen corresponding path program 1 times [2018-11-28 22:45:49,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:49,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:49,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:49,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:49,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:49,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:49,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:45:49,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:45:49,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 22:45:49,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 22:45:49,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 22:45:49,845 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2018-11-28 22:45:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:49,868 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-11-28 22:45:49,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 22:45:49,870 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-11-28 22:45:49,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:49,882 INFO L225 Difference]: With dead ends: 85 [2018-11-28 22:45:49,882 INFO L226 Difference]: Without dead ends: 82 [2018-11-28 22:45:49,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 22:45:49,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-28 22:45:49,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-28 22:45:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 22:45:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-11-28 22:45:49,932 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 8 [2018-11-28 22:45:49,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:49,932 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-11-28 22:45:49,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 22:45:49,933 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-28 22:45:49,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 22:45:49,933 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:49,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:45:49,934 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION]=== [2018-11-28 22:45:49,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:49,935 INFO L82 PathProgramCache]: Analyzing trace with hash -95705117, now seen corresponding path program 1 times [2018-11-28 22:45:49,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:49,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:49,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:49,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:49,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:50,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:45:50,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:45:50,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:45:50,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:45:50,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:45:50,189 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 5 states. [2018-11-28 22:45:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:50,817 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-28 22:45:50,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:45:50,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 22:45:50,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:50,821 INFO L225 Difference]: With dead ends: 74 [2018-11-28 22:45:50,821 INFO L226 Difference]: Without dead ends: 74 [2018-11-28 22:45:50,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:45:50,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-28 22:45:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-28 22:45:50,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 22:45:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-28 22:45:50,831 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 9 [2018-11-28 22:45:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:50,832 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-28 22:45:50,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:45:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-28 22:45:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 22:45:50,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:50,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:45:50,833 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION]=== [2018-11-28 22:45:50,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash -95705116, now seen corresponding path program 1 times [2018-11-28 22:45:50,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:50,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:50,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:50,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:50,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:51,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:45:51,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:45:51,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:45:51,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:45:51,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:45:51,002 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-11-28 22:45:51,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:51,475 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-28 22:45:51,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:45:51,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 22:45:51,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:51,479 INFO L225 Difference]: With dead ends: 90 [2018-11-28 22:45:51,479 INFO L226 Difference]: Without dead ends: 90 [2018-11-28 22:45:51,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:45:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-28 22:45:51,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2018-11-28 22:45:51,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-28 22:45:51,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-11-28 22:45:51,490 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 9 [2018-11-28 22:45:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:51,491 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-11-28 22:45:51,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:45:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-11-28 22:45:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:45:51,491 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:51,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:45:51,492 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION]=== [2018-11-28 22:45:51,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:51,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1328108723, now seen corresponding path program 1 times [2018-11-28 22:45:51,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:51,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:51,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:51,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:51,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:51,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:45:51,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:45:51,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:45:51,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:45:51,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:45:51,550 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 3 states. [2018-11-28 22:45:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:51,655 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-11-28 22:45:51,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:45:51,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:45:51,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:51,658 INFO L225 Difference]: With dead ends: 75 [2018-11-28 22:45:51,658 INFO L226 Difference]: Without dead ends: 75 [2018-11-28 22:45:51,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:45:51,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-28 22:45:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-28 22:45:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-28 22:45:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-11-28 22:45:51,665 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 10 [2018-11-28 22:45:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:51,665 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-11-28 22:45:51,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:45:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-11-28 22:45:51,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:45:51,666 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:51,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:45:51,667 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION]=== [2018-11-28 22:45:51,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:51,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1328108724, now seen corresponding path program 1 times [2018-11-28 22:45:51,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:51,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:51,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:51,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:51,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:51,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:45:51,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:45:51,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:45:51,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:45:51,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:45:51,736 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 3 states. [2018-11-28 22:45:51,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:51,830 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-11-28 22:45:51,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:45:51,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:45:51,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:51,832 INFO L225 Difference]: With dead ends: 71 [2018-11-28 22:45:51,832 INFO L226 Difference]: Without dead ends: 71 [2018-11-28 22:45:51,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:45:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-28 22:45:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-28 22:45:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-28 22:45:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-11-28 22:45:51,839 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 10 [2018-11-28 22:45:51,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:51,840 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-11-28 22:45:51,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:45:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-11-28 22:45:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 22:45:51,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:51,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:45:51,841 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION]=== [2018-11-28 22:45:51,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:51,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1312633070, now seen corresponding path program 1 times [2018-11-28 22:45:51,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:51,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:51,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:51,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:51,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:52,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:52,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:45:52,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 22:45:52,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:45:52,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:45:52,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:45:52,082 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 8 states. [2018-11-28 22:45:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:52,437 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-11-28 22:45:52,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 22:45:52,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-28 22:45:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:52,440 INFO L225 Difference]: With dead ends: 82 [2018-11-28 22:45:52,440 INFO L226 Difference]: Without dead ends: 82 [2018-11-28 22:45:52,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-28 22:45:52,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-28 22:45:52,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-11-28 22:45:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 22:45:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-11-28 22:45:52,450 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 15 [2018-11-28 22:45:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:52,450 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-11-28 22:45:52,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:45:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-11-28 22:45:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 22:45:52,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:52,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:45:52,452 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION]=== [2018-11-28 22:45:52,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:52,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2037197624, now seen corresponding path program 1 times [2018-11-28 22:45:52,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:52,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:52,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:52,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:52,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:52,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:45:52,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:45:52,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:45:52,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:45:52,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:45:52,588 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 7 states. [2018-11-28 22:45:52,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:52,905 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-11-28 22:45:52,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:45:52,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-28 22:45:52,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:52,907 INFO L225 Difference]: With dead ends: 77 [2018-11-28 22:45:52,908 INFO L226 Difference]: Without dead ends: 77 [2018-11-28 22:45:52,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:45:52,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-28 22:45:52,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2018-11-28 22:45:52,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 22:45:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-11-28 22:45:52,916 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 16 [2018-11-28 22:45:52,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:52,918 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-11-28 22:45:52,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:45:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-11-28 22:45:52,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 22:45:52,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:52,919 INFO L402 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] [2018-11-28 22:45:52,921 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION]=== [2018-11-28 22:45:52,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:52,922 INFO L82 PathProgramCache]: Analyzing trace with hash -200406812, now seen corresponding path program 1 times [2018-11-28 22:45:52,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:52,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:52,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:52,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:52,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:53,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:45:53,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:45:53,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:45:53,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:45:53,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:45:53,085 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 7 states. [2018-11-28 22:45:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:53,447 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-11-28 22:45:53,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:45:53,448 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-28 22:45:53,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:53,450 INFO L225 Difference]: With dead ends: 80 [2018-11-28 22:45:53,450 INFO L226 Difference]: Without dead ends: 80 [2018-11-28 22:45:53,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:45:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-28 22:45:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2018-11-28 22:45:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 22:45:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-11-28 22:45:53,457 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 24 [2018-11-28 22:45:53,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:53,459 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-11-28 22:45:53,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:45:53,459 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-11-28 22:45:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 22:45:53,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:53,460 INFO L402 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] [2018-11-28 22:45:53,460 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION]=== [2018-11-28 22:45:53,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:53,461 INFO L82 PathProgramCache]: Analyzing trace with hash -200406811, now seen corresponding path program 1 times [2018-11-28 22:45:53,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:53,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:53,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:53,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:53,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:53,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:53,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:45:53,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:45:53,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:45:53,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:45:53,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:45:53,651 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 7 states. [2018-11-28 22:45:53,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:53,914 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-11-28 22:45:53,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:45:53,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-28 22:45:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:53,917 INFO L225 Difference]: With dead ends: 82 [2018-11-28 22:45:53,917 INFO L226 Difference]: Without dead ends: 82 [2018-11-28 22:45:53,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:45:53,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-28 22:45:53,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-11-28 22:45:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 22:45:53,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-11-28 22:45:53,924 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 24 [2018-11-28 22:45:53,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:53,924 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-11-28 22:45:53,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:45:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-11-28 22:45:53,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 22:45:53,925 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:53,926 INFO L402 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] [2018-11-28 22:45:53,926 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION]=== [2018-11-28 22:45:53,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:53,926 INFO L82 PathProgramCache]: Analyzing trace with hash 700839514, now seen corresponding path program 1 times [2018-11-28 22:45:53,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:53,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:53,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:53,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:53,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:54,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:45:54,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:45:54,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:45:54,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:45:54,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:45:54,053 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-11-28 22:45:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:54,242 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-11-28 22:45:54,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:45:54,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-28 22:45:54,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:54,244 INFO L225 Difference]: With dead ends: 66 [2018-11-28 22:45:54,245 INFO L226 Difference]: Without dead ends: 66 [2018-11-28 22:45:54,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:45:54,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-28 22:45:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-28 22:45:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 22:45:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-11-28 22:45:54,249 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2018-11-28 22:45:54,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:54,250 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-11-28 22:45:54,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:45:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-11-28 22:45:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 22:45:54,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:54,251 INFO L402 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] [2018-11-28 22:45:54,251 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION]=== [2018-11-28 22:45:54,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:54,252 INFO L82 PathProgramCache]: Analyzing trace with hash -314795811, now seen corresponding path program 1 times [2018-11-28 22:45:54,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:54,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:54,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:54,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:54,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:54,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:45:54,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:45:54,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:45:54,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:45:54,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:45:54,681 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 6 states. [2018-11-28 22:45:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:54,806 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-11-28 22:45:54,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:45:54,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-28 22:45:54,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:54,809 INFO L225 Difference]: With dead ends: 65 [2018-11-28 22:45:54,809 INFO L226 Difference]: Without dead ends: 65 [2018-11-28 22:45:54,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:45:54,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-28 22:45:54,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-28 22:45:54,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 22:45:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-11-28 22:45:54,813 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 27 [2018-11-28 22:45:54,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:54,814 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-11-28 22:45:54,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:45:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-11-28 22:45:54,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:45:54,815 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:54,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:45:54,815 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION]=== [2018-11-28 22:45:54,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:54,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1168735483, now seen corresponding path program 1 times [2018-11-28 22:45:54,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:54,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:54,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:54,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:54,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:55,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:45:55,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:45:55,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:45:55,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:45:55,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:45:55,166 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 7 states. [2018-11-28 22:45:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:55,344 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-28 22:45:55,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:45:55,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-11-28 22:45:55,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:55,346 INFO L225 Difference]: With dead ends: 64 [2018-11-28 22:45:55,346 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 22:45:55,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:45:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 22:45:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-28 22:45:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 22:45:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-11-28 22:45:55,352 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 28 [2018-11-28 22:45:55,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:55,352 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-11-28 22:45:55,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:45:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-28 22:45:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 22:45:55,353 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:55,353 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:45:55,354 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION]=== [2018-11-28 22:45:55,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:55,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1776628288, now seen corresponding path program 1 times [2018-11-28 22:45:55,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:55,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:55,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:55,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:55,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:56,027 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-28 22:45:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:56,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:45:56,127 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:45:56,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:56,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:45:56,655 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 22:45:56,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:45:56,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:56,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:56,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:56,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-11-28 22:45:57,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-28 22:45:57,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:57,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:57,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-11-28 22:45:57,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-28 22:45:57,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-28 22:45:57,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:57,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:57,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:45:57,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-11-28 22:45:57,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-11-28 22:45:57,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-11-28 22:45:57,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:57,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-11-28 22:45:57,729 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:57,760 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-11-28 22:45:57,760 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:57,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:57,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:45:57,769 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-11-28 22:45:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:57,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:45:57,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 15 [2018-11-28 22:45:57,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 22:45:57,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 22:45:57,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-11-28 22:45:57,815 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 16 states. [2018-11-28 22:45:58,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:58,726 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-28 22:45:58,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:45:58,728 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-11-28 22:45:58,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:58,729 INFO L225 Difference]: With dead ends: 70 [2018-11-28 22:45:58,729 INFO L226 Difference]: Without dead ends: 70 [2018-11-28 22:45:58,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-11-28 22:45:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-28 22:45:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-28 22:45:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 22:45:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-11-28 22:45:58,736 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 29 [2018-11-28 22:45:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:58,736 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-28 22:45:58,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 22:45:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-28 22:45:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 22:45:58,737 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:58,737 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:45:58,738 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION]=== [2018-11-28 22:45:58,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:58,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1776628289, now seen corresponding path program 1 times [2018-11-28 22:45:58,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:58,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:58,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:58,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:58,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:59,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:45:59,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:45:59,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:59,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:45:59,174 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 22:45:59,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:45:59,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,196 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 22:45:59,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:45:59,200 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-11-28 22:45:59,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:45:59,337 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:45:59,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 22:45:59,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,353 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 22:45:59,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-11-28 22:45:59,557 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-11-28 22:45:59,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-28 22:45:59,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-28 22:45:59,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-11-28 22:45:59,671 INFO L478 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 27 treesize of output 27 [2018-11-28 22:45:59,672 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 30 treesize of output 29 [2018-11-28 22:45:59,711 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:45:59,743 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-11-28 22:45:59,798 INFO L478 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 36 treesize of output 34 [2018-11-28 22:45:59,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-28 22:45:59,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-28 22:45:59,840 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-11-28 22:45:59,869 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,902 INFO L478 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 26 treesize of output 26 [2018-11-28 22:45:59,908 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-11-28 22:45:59,908 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,931 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:59,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:45:59,943 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-11-28 22:45:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:45:59,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:45:59,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2018-11-28 22:45:59,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 22:45:59,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 22:45:59,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-28 22:45:59,994 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 17 states. [2018-11-28 22:46:01,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:01,264 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-11-28 22:46:01,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 22:46:01,265 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-11-28 22:46:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:01,269 INFO L225 Difference]: With dead ends: 69 [2018-11-28 22:46:01,269 INFO L226 Difference]: Without dead ends: 69 [2018-11-28 22:46:01,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-11-28 22:46:01,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-28 22:46:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-28 22:46:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 22:46:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-28 22:46:01,274 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 29 [2018-11-28 22:46:01,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:01,277 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-28 22:46:01,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 22:46:01,277 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-28 22:46:01,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 22:46:01,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:01,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:46:01,279 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION]=== [2018-11-28 22:46:01,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:01,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1871061536, now seen corresponding path program 1 times [2018-11-28 22:46:01,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:46:01,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:46:01,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:46:01,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:01,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:46:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:01,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:01,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:46:01,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:46:01,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:46:01,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:46:01,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:46:01,523 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 8 states. [2018-11-28 22:46:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:02,061 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-28 22:46:02,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:46:02,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-28 22:46:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:02,064 INFO L225 Difference]: With dead ends: 66 [2018-11-28 22:46:02,064 INFO L226 Difference]: Without dead ends: 66 [2018-11-28 22:46:02,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:46:02,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-28 22:46:02,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-28 22:46:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 22:46:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-11-28 22:46:02,070 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 29 [2018-11-28 22:46:02,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:02,070 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-11-28 22:46:02,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:46:02,071 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-28 22:46:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 22:46:02,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:02,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:46:02,072 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION]=== [2018-11-28 22:46:02,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:02,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1871061535, now seen corresponding path program 1 times [2018-11-28 22:46:02,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:46:02,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:46:02,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:46:02,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:02,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:46:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:02,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:46:02,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:46:02,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:46:02,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:46:02,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:46:02,133 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 3 states. [2018-11-28 22:46:02,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:02,181 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-28 22:46:02,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:46:02,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 22:46:02,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:02,185 INFO L225 Difference]: With dead ends: 61 [2018-11-28 22:46:02,185 INFO L226 Difference]: Without dead ends: 61 [2018-11-28 22:46:02,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:46:02,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-28 22:46:02,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-28 22:46:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 22:46:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-11-28 22:46:02,189 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 29 [2018-11-28 22:46:02,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:02,189 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-11-28 22:46:02,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:46:02,189 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-28 22:46:02,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 22:46:02,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:02,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:46:02,190 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION]=== [2018-11-28 22:46:02,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:02,191 INFO L82 PathProgramCache]: Analyzing trace with hash -492861402, now seen corresponding path program 1 times [2018-11-28 22:46:02,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:46:02,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:46:02,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:46:02,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:02,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:46:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 22:46:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 22:46:02,246 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 22:46:02,265 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-11-28 22:46:02,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:46:02 BoogieIcfgContainer [2018-11-28 22:46:02,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:46:02,283 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:46:02,283 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:46:02,284 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:46:02,284 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:45:49" (3/4) ... [2018-11-28 22:46:02,288 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 22:46:02,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:46:02,289 INFO L168 Benchmark]: Toolchain (without parser) took 14559.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.7 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -210.2 MB). Peak memory consumption was 75.6 MB. Max. memory is 11.5 GB. [2018-11-28 22:46:02,290 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:46:02,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 668.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -142.3 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-11-28 22:46:02,292 INFO L168 Benchmark]: Boogie Preprocessor took 68.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-28 22:46:02,292 INFO L168 Benchmark]: RCFGBuilder took 1108.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.2 MB). Peak memory consumption was 54.2 MB. Max. memory is 11.5 GB. [2018-11-28 22:46:02,293 INFO L168 Benchmark]: TraceAbstraction took 12702.95 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -129.0 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. [2018-11-28 22:46:02,293 INFO L168 Benchmark]: Witness Printer took 5.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:46:02,297 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 668.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -142.3 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1108.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.2 MB). Peak memory consumption was 54.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12702.95 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -129.0 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 633]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 633. Possible FailurePath: [L635] struct item *list = ((void *)0); VAL [list={10:0}] [L637] CALL append(&list) VAL [plist={10:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L627] item->next = *plist VAL [\read(**plist)={0:0}, item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L628] EXPR item->next VAL [item={13:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, item={13:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, item={13:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L631] *plist = item VAL [item={13:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L637] RET append(&list) VAL [list={10:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] \read(*list) VAL [\read(*list)={13:0}, list={10:0}] [L639] COND TRUE \read(*list) [L640] EXPR \read(*list) VAL [\read(*list)={13:0}, list={10:0}] [L640] EXPR list->next VAL [\read(*list)={13:0}, list={10:0}, list->next={0:0}] [L640] struct item *next = list->next; [L641] EXPR \read(*list) VAL [\read(*list)={13:0}, list={10:0}, next={0:0}] [L641] free(list) VAL [\read(*list)={13:0}, list={10:0}, next={0:0}] [L641] free(list) [L642] list = next VAL [list={10:0}, next={0:0}] [L644] \read(*list) VAL [\read(*list)={0:0}, list={10:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) [L649] return 0; [L635] struct item *list = ((void *)0); [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 85 locations, 39 error locations. UNSAFE Result, 12.6s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 729 SDtfs, 693 SDslu, 1688 SDs, 0 SdLazy, 2061 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 39 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 362 ConstructedInterpolants, 11 QuantifiedInterpolants, 77138 SizeOfPredicates, 35 NumberOfNonLiveVariables, 366 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-91b1670 [2018-11-28 22:46:04,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:46:04,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:46:04,646 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:46:04,646 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:46:04,648 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:46:04,649 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:46:04,651 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:46:04,653 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:46:04,654 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:46:04,655 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:46:04,655 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:46:04,656 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:46:04,657 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:46:04,659 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:46:04,659 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:46:04,660 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:46:04,662 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:46:04,665 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:46:04,667 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:46:04,668 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:46:04,669 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:46:04,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:46:04,672 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:46:04,673 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:46:04,674 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:46:04,675 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:46:04,676 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:46:04,677 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:46:04,678 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:46:04,679 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:46:04,679 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:46:04,680 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:46:04,680 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:46:04,681 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:46:04,683 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:46:04,683 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-11-28 22:46:04,698 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:46:04,699 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:46:04,700 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:46:04,700 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:46:04,700 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:46:04,701 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:46:04,701 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:46:04,701 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:46:04,702 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:46:04,702 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:46:04,702 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:46:04,702 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:46:04,702 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:46:04,702 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:46:04,703 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:46:04,703 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:46:04,703 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:46:04,703 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-28 22:46:04,703 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-28 22:46:04,703 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:46:04,705 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:46:04,705 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:46:04,705 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:46:04,706 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:46:04,706 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:46:04,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:46:04,706 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:46:04,706 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:46:04,707 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-28 22:46:04,708 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:46:04,708 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-28 22:46:04,708 INFO L133 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 [2018-11-28 22:46:04,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:46:04,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:46:04,766 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:46:04,768 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:46:04,768 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:46:04,769 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.i [2018-11-28 22:46:04,826 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ef82274d/2da5830919d4407699bd6ece032149e6/FLAGde91e496b [2018-11-28 22:46:05,360 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:46:05,361 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.i [2018-11-28 22:46:05,374 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ef82274d/2da5830919d4407699bd6ece032149e6/FLAGde91e496b [2018-11-28 22:46:05,633 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ef82274d/2da5830919d4407699bd6ece032149e6 [2018-11-28 22:46:05,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:46:05,640 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:46:05,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:46:05,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:46:05,647 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:46:05,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:46:05" (1/1) ... [2018-11-28 22:46:05,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349443ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:46:05, skipping insertion in model container [2018-11-28 22:46:05,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:46:05" (1/1) ... [2018-11-28 22:46:05,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:46:05,721 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:46:06,135 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:46:06,145 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:46:06,191 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:46:06,329 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:46:06,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:46:06 WrapperNode [2018-11-28 22:46:06,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:46:06,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:46:06,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:46:06,331 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:46:06,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:46:06" (1/1) ... [2018-11-28 22:46:06,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:46:06" (1/1) ... [2018-11-28 22:46:06,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:46:06" (1/1) ... [2018-11-28 22:46:06,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:46:06" (1/1) ... [2018-11-28 22:46:06,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:46:06" (1/1) ... [2018-11-28 22:46:06,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:46:06" (1/1) ... [2018-11-28 22:46:06,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:46:06" (1/1) ... [2018-11-28 22:46:06,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:46:06,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:46:06,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:46:06,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:46:06,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:46:06" (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 [2018-11-28 22:46:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:46:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:46:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-28 22:46:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:46:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 22:46:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:46:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:46:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:46:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:46:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:46:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:46:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:46:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:46:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:46:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:46:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:46:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:46:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:46:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:46:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:46:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:46:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:46:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:46:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:46:06,480 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:46:06,480 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:46:06,480 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:46:06,480 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:46:06,480 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:46:06,480 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:46:06,480 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:46:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:46:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:46:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:46:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:46:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:46:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:46:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:46:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:46:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:46:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:46:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:46:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:46:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:46:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:46:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:46:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:46:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:46:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:46:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:46:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:46:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:46:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:46:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:46:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:46:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:46:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:46:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:46:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:46:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:46:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:46:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:46:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:46:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:46:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:46:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:46:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:46:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:46:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:46:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 22:46:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:46:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:46:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:46:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:46:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:46:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:46:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:46:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:46:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:46:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:46:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:46:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:46:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:46:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:46:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:46:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:46:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:46:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:46:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:46:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:46:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:46:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:46:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:46:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:46:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:46:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:46:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:46:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:46:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:46:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:46:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:46:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:46:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:46:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:46:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:46:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:46:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 22:46:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-28 22:46:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:46:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 22:46:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 22:46:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:46:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 22:46:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:46:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:46:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:46:07,633 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:46:07,633 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 22:46:07,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:46:07 BoogieIcfgContainer [2018-11-28 22:46:07,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:46:07,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:46:07,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:46:07,640 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:46:07,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:46:05" (1/3) ... [2018-11-28 22:46:07,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7786665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:46:07, skipping insertion in model container [2018-11-28 22:46:07,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:46:06" (2/3) ... [2018-11-28 22:46:07,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7786665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:46:07, skipping insertion in model container [2018-11-28 22:46:07,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:46:07" (3/3) ... [2018-11-28 22:46:07,645 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-11-28 22:46:07,665 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:46:07,675 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-11-28 22:46:07,696 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-11-28 22:46:07,722 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:46:07,723 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:46:07,723 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:46:07,723 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:46:07,724 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:46:07,724 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:46:07,725 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:46:07,725 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:46:07,725 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:46:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-11-28 22:46:07,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 22:46:07,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:07,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:46:07,760 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 22:46:07,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:07,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1993923955, now seen corresponding path program 1 times [2018-11-28 22:46:07,777 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:46:07,778 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:46:07,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:07,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:46:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:07,867 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:46:07,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:46:07,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:46:07,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 22:46:07,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 22:46:07,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 22:46:07,895 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-11-28 22:46:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:07,919 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-11-28 22:46:07,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 22:46:07,921 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-11-28 22:46:07,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:07,933 INFO L225 Difference]: With dead ends: 84 [2018-11-28 22:46:07,933 INFO L226 Difference]: Without dead ends: 81 [2018-11-28 22:46:07,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 22:46:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-28 22:46:07,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-28 22:46:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-28 22:46:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2018-11-28 22:46:07,980 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 8 [2018-11-28 22:46:07,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:07,980 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2018-11-28 22:46:07,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 22:46:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-11-28 22:46:07,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 22:46:07,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:07,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:46:07,982 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 22:46:07,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:07,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1682195681, now seen corresponding path program 1 times [2018-11-28 22:46:07,983 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:46:07,983 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:46:08,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:08,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:46:08,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 22:46:08,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:08,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:08,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 22:46:08,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:08,201 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:08,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-11-28 22:46:08,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:08,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:08,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-11-28 22:46:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:08,377 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-28 22:46:08,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:46:08,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:46:08,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:46:08,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:46:08,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:46:08,385 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 5 states. [2018-11-28 22:46:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:09,156 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-11-28 22:46:09,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:46:09,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 22:46:09,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:09,159 INFO L225 Difference]: With dead ends: 73 [2018-11-28 22:46:09,159 INFO L226 Difference]: Without dead ends: 73 [2018-11-28 22:46:09,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:46:09,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-28 22:46:09,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-11-28 22:46:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 22:46:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-11-28 22:46:09,172 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 9 [2018-11-28 22:46:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:09,172 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-11-28 22:46:09,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:46:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-28 22:46:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 22:46:09,173 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:09,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:46:09,174 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 22:46:09,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:09,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1682195682, now seen corresponding path program 1 times [2018-11-28 22:46:09,176 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:46:09,176 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:46:09,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:09,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:46:09,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 22:46:09,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:09,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 22:46:09,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:09,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:09,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 22:46:09,372 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:09,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:09,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 22:46:09,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:09,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:09,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:09,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-28 22:46:09,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:09,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:09,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-11-28 22:46:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:09,713 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:46:09,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:46:09,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:46:09,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:46:09,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:46:09,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:46:09,718 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 5 states. [2018-11-28 22:46:10,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:10,281 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-11-28 22:46:10,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:46:10,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 22:46:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:10,286 INFO L225 Difference]: With dead ends: 89 [2018-11-28 22:46:10,286 INFO L226 Difference]: Without dead ends: 89 [2018-11-28 22:46:10,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:46:10,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-28 22:46:10,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-11-28 22:46:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 22:46:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-11-28 22:46:10,297 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 9 [2018-11-28 22:46:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:10,297 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-11-28 22:46:10,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:46:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-11-28 22:46:10,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:46:10,298 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:10,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:46:10,300 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 22:46:10,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:10,301 INFO L82 PathProgramCache]: Analyzing trace with hash 608458612, now seen corresponding path program 1 times [2018-11-28 22:46:10,301 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:46:10,301 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:46:10,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:10,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:46:10,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 22:46:10,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:10,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:10,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 22:46:10,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:10,470 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:46:10,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:46:10,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:46:10,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:46:10,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:46:10,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:46:10,474 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 3 states. [2018-11-28 22:46:10,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:10,628 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-11-28 22:46:10,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:46:10,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:46:10,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:10,630 INFO L225 Difference]: With dead ends: 74 [2018-11-28 22:46:10,630 INFO L226 Difference]: Without dead ends: 74 [2018-11-28 22:46:10,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:46:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-28 22:46:10,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-28 22:46:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 22:46:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-11-28 22:46:10,639 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 10 [2018-11-28 22:46:10,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:10,639 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-11-28 22:46:10,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:46:10,640 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-11-28 22:46:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:46:10,641 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:10,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:46:10,642 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 22:46:10,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:10,643 INFO L82 PathProgramCache]: Analyzing trace with hash 608458613, now seen corresponding path program 1 times [2018-11-28 22:46:10,643 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:46:10,643 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:46:10,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:10,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:46:10,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 22:46:10,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:10,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:10,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 22:46:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:10,804 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:46:10,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:46:10,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:46:10,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:46:10,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:46:10,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:46:10,807 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 3 states. [2018-11-28 22:46:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:10,933 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-28 22:46:10,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:46:10,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:46:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:10,936 INFO L225 Difference]: With dead ends: 70 [2018-11-28 22:46:10,936 INFO L226 Difference]: Without dead ends: 70 [2018-11-28 22:46:10,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:46:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-28 22:46:10,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-28 22:46:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-28 22:46:10,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-11-28 22:46:10,944 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 10 [2018-11-28 22:46:10,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:10,945 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-11-28 22:46:10,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:46:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-28 22:46:10,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 22:46:10,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:10,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:46:10,947 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 22:46:10,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:10,947 INFO L82 PathProgramCache]: Analyzing trace with hash 620506892, now seen corresponding path program 1 times [2018-11-28 22:46:10,947 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:46:10,948 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:46:10,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:11,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:46:11,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-28 22:46:11,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-28 22:46:11,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:11,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:11,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-28 22:46:11,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-11-28 22:46:11,371 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:11,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-28 22:46:11,413 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:11,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:11,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:11,465 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-11-28 22:46:11,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-28 22:46:11,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-28 22:46:11,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:11,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 22:46:11,782 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:11,842 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-11-28 22:46:11,843 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:11,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:11,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-28 22:46:11,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-28 22:46:11,930 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:11,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 22:46:11,971 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:12,001 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-11-28 22:46:12,002 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:12,013 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:12,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:12,020 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2018-11-28 22:46:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:12,050 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:46:12,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:46:12,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 22:46:12,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:46:12,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:46:12,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=38, Unknown=5, NotChecked=0, Total=56 [2018-11-28 22:46:12,057 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 8 states. [2018-11-28 22:46:12,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:12,903 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-11-28 22:46:12,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 22:46:12,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-28 22:46:12,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:12,905 INFO L225 Difference]: With dead ends: 78 [2018-11-28 22:46:12,905 INFO L226 Difference]: Without dead ends: 78 [2018-11-28 22:46:12,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=97, Unknown=13, NotChecked=0, Total=156 [2018-11-28 22:46:12,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-28 22:46:12,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-28 22:46:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 22:46:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-11-28 22:46:12,915 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 15 [2018-11-28 22:46:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:12,915 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-11-28 22:46:12,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:46:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-11-28 22:46:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 22:46:12,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:12,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:46:12,917 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 22:46:12,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:12,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2056122585, now seen corresponding path program 1 times [2018-11-28 22:46:12,920 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:46:12,920 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:46:12,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:13,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:46:13,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:13,158 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-28 22:46:13,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:13,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:13,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:13,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 22:46:13,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:13,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:13,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-11-28 22:46:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:13,236 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:46:13,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:46:13,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:46:13,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:46:13,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:46:13,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:46:13,239 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 7 states. [2018-11-28 22:46:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:13,915 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-11-28 22:46:13,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:46:13,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-28 22:46:13,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:13,918 INFO L225 Difference]: With dead ends: 78 [2018-11-28 22:46:13,918 INFO L226 Difference]: Without dead ends: 78 [2018-11-28 22:46:13,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:46:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-28 22:46:13,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-28 22:46:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 22:46:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-11-28 22:46:13,930 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 16 [2018-11-28 22:46:13,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:13,931 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-11-28 22:46:13,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:46:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-11-28 22:46:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:46:13,932 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:13,932 INFO L402 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] [2018-11-28 22:46:13,933 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 22:46:13,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:13,933 INFO L82 PathProgramCache]: Analyzing trace with hash -811500198, now seen corresponding path program 1 times [2018-11-28 22:46:13,934 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:46:13,934 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:46:13,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:14,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:46:14,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:46:14,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:14,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:14,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-11-28 22:46:14,114 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 22:46:14,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:46:14,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:14,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:14,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:14,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-28 22:46:14,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 22:46:14,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-28 22:46:14,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:14,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:14,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:14,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-11-28 22:46:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:14,191 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:46:14,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:46:14,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:46:14,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:46:14,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:46:14,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:46:14,196 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 8 states. [2018-11-28 22:46:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:15,037 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-28 22:46:15,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:46:15,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-28 22:46:15,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:15,040 INFO L225 Difference]: With dead ends: 84 [2018-11-28 22:46:15,040 INFO L226 Difference]: Without dead ends: 84 [2018-11-28 22:46:15,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:46:15,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-28 22:46:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2018-11-28 22:46:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 22:46:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-11-28 22:46:15,048 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 23 [2018-11-28 22:46:15,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:15,049 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-11-28 22:46:15,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:46:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-11-28 22:46:15,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:46:15,050 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:15,051 INFO L402 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] [2018-11-28 22:46:15,051 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 22:46:15,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:15,051 INFO L82 PathProgramCache]: Analyzing trace with hash -811500197, now seen corresponding path program 1 times [2018-11-28 22:46:15,051 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:46:15,054 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:46:15,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:15,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:46:15,246 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 22:46:15,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:46:15,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:15,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:15,285 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 22:46:15,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:46:15,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:15,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:15,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:15,308 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-11-28 22:46:15,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 22:46:15,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 22:46:15,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:15,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:15,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-28 22:46:15,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 22:46:15,411 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:15,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:15,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:15,423 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-11-28 22:46:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:15,448 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:46:15,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:46:15,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:46:15,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:46:15,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:46:15,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:46:15,451 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 8 states. [2018-11-28 22:46:16,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:16,096 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-11-28 22:46:16,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:46:16,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-28 22:46:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:16,098 INFO L225 Difference]: With dead ends: 86 [2018-11-28 22:46:16,098 INFO L226 Difference]: Without dead ends: 86 [2018-11-28 22:46:16,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:46:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-28 22:46:16,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2018-11-28 22:46:16,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 22:46:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-11-28 22:46:16,104 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 23 [2018-11-28 22:46:16,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:16,104 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-11-28 22:46:16,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:46:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-11-28 22:46:16,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 22:46:16,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:16,107 INFO L402 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] [2018-11-28 22:46:16,107 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 22:46:16,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:16,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1850615088, now seen corresponding path program 1 times [2018-11-28 22:46:16,109 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:46:16,109 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:46:16,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:16,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:46:16,285 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 22:46:16,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-28 22:46:16,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:16,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:16,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:16,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-28 22:46:16,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-28 22:46:16,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-28 22:46:16,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:16,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:16,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:16,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-28 22:46:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:16,365 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:46:16,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:46:16,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:46:16,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:46:16,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:46:16,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:46:16,374 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 7 states. [2018-11-28 22:46:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:16,689 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-28 22:46:16,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:46:16,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-28 22:46:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:16,692 INFO L225 Difference]: With dead ends: 70 [2018-11-28 22:46:16,693 INFO L226 Difference]: Without dead ends: 70 [2018-11-28 22:46:16,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:46:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-28 22:46:16,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-28 22:46:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-28 22:46:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-11-28 22:46:16,699 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 25 [2018-11-28 22:46:16,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:16,699 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-11-28 22:46:16,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:46:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-28 22:46:16,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 22:46:16,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:16,702 INFO L402 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] [2018-11-28 22:46:16,702 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 22:46:16,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:16,704 INFO L82 PathProgramCache]: Analyzing trace with hash 968508614, now seen corresponding path program 1 times [2018-11-28 22:46:16,704 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:46:16,704 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:46:16,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:16,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:46:16,903 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 22:46:16,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:46:16,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:16,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:16,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:16,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-28 22:46:16,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 22:46:17,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 22:46:17,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:17,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:17,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:17,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-28 22:46:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:17,055 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:46:17,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:46:17,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:46:17,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:46:17,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:46:17,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:46:17,060 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 7 states. [2018-11-28 22:46:17,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:17,438 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-28 22:46:17,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:46:17,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-28 22:46:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:17,442 INFO L225 Difference]: With dead ends: 69 [2018-11-28 22:46:17,442 INFO L226 Difference]: Without dead ends: 69 [2018-11-28 22:46:17,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:46:17,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-28 22:46:17,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-28 22:46:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 22:46:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2018-11-28 22:46:17,453 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 26 [2018-11-28 22:46:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:17,453 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2018-11-28 22:46:17,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:46:17,455 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-28 22:46:17,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 22:46:17,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:17,461 INFO L402 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] [2018-11-28 22:46:17,462 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 22:46:17,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:17,462 INFO L82 PathProgramCache]: Analyzing trace with hash -41003973, now seen corresponding path program 1 times [2018-11-28 22:46:17,462 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:46:17,462 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:46:17,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:17,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:46:17,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:46:17,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:17,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:17,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-11-28 22:46:17,663 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 22:46:17,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:46:17,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:17,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:17,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:17,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-28 22:46:17,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 22:46:17,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-28 22:46:17,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:17,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:17,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:17,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-11-28 22:46:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:17,746 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:46:17,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:46:17,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:46:17,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:46:17,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:46:17,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:46:17,750 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 8 states. [2018-11-28 22:46:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:18,176 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-28 22:46:18,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:46:18,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-28 22:46:18,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:18,178 INFO L225 Difference]: With dead ends: 68 [2018-11-28 22:46:18,178 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 22:46:18,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:46:18,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 22:46:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-28 22:46:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 22:46:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-11-28 22:46:18,183 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 27 [2018-11-28 22:46:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:18,183 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-11-28 22:46:18,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:46:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-28 22:46:18,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:46:18,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:18,188 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:46:18,189 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 22:46:18,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:18,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1918400567, now seen corresponding path program 1 times [2018-11-28 22:46:18,190 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:46:18,190 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:46:18,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:18,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:46:18,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:46:18,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:18,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:18,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-11-28 22:46:18,413 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 22:46:18,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:46:18,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:18,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:18,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:18,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-28 22:46:18,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 22:46:18,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:18,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:18,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2018-11-28 22:46:18,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-28 22:46:18,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-28 22:46:18,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:18,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:18,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:18,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2018-11-28 22:46:18,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-11-28 22:46:18,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-11-28 22:46:18,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:18,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-11-28 22:46:18,863 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:18,923 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-11-28 22:46:18,924 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:18,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:18,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:18,944 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2018-11-28 22:46:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:18,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 22:46:19,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-28 22:46:19,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-28 22:46:19,264 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:19,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:19,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-28 22:46:19,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:50 [2018-11-28 22:46:19,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-11-28 22:46:19,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:19,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-11-28 22:46:19,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:19,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:46:19,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-11-28 22:46:19,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-11-28 22:46:19,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:19,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-11-28 22:46:19,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:19,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:46:19,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2018-11-28 22:46:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:19,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:46:19,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-11-28 22:46:19,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 22:46:19,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 22:46:19,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-28 22:46:19,505 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 17 states. [2018-11-28 22:46:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:21,236 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-28 22:46:21,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:46:21,238 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-11-28 22:46:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:21,239 INFO L225 Difference]: With dead ends: 72 [2018-11-28 22:46:21,239 INFO L226 Difference]: Without dead ends: 72 [2018-11-28 22:46:21,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-11-28 22:46:21,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-28 22:46:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2018-11-28 22:46:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 22:46:21,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-28 22:46:21,244 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 28 [2018-11-28 22:46:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:21,244 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-28 22:46:21,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 22:46:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-28 22:46:21,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:46:21,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:21,245 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:46:21,252 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 22:46:21,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:21,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1918400566, now seen corresponding path program 1 times [2018-11-28 22:46:21,252 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:46:21,252 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:46:21,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:21,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:46:21,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 22:46:21,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:21,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 22:46:21,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:21,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:21,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-11-28 22:46:21,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:21,544 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:46:21,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:21,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:21,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:21,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 22:46:21,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:21,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:21,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-11-28 22:46:21,788 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 22:46:21,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:46:21,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:21,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:21,830 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 22:46:21,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-28 22:46:21,835 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:21,843 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:21,865 INFO L267 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. [2018-11-28 22:46:21,866 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:43 [2018-11-28 22:46:22,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:22,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2018-11-28 22:46:22,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:22,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:22,355 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:22,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-28 22:46:22,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:22,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:22,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:46 [2018-11-28 22:46:22,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-28 22:46:22,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-28 22:46:22,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:22,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:22,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 43 [2018-11-28 22:46:22,741 INFO L478 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 29 treesize of output 29 [2018-11-28 22:46:22,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:22,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 31 [2018-11-28 22:46:22,801 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:22,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:22,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:22,848 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2018-11-28 22:46:22,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-28 22:46:22,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-28 22:46:22,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:23,012 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-11-28 22:46:23,012 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:23,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:23,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2018-11-28 22:46:23,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-28 22:46:23,079 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:23,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-11-28 22:46:23,119 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:23,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-11-28 22:46:23,153 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:23,166 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:23,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:23,178 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:68, output treesize:18 [2018-11-28 22:46:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:23,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 22:46:25,026 WARN L180 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-11-28 22:46:25,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-28 22:46:25,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 22:46:25,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:25,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:25,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-28 22:46:25,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 22:46:25,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:25,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:25,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-28 22:46:25,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 22:46:25,081 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:25,087 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:25,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-11-28 22:46:25,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-28 22:46:25,323 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:25,329 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:25,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-11-28 22:46:25,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-28 22:46:25,338 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:25,343 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:25,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-28 22:46:25,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-28 22:46:25,523 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:25,541 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:25,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-28 22:46:25,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-28 22:46:25,551 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:25,570 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:25,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-28 22:46:25,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-28 22:46:25,776 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:25,793 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:25,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-28 22:46:25,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-28 22:46:25,803 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:25,821 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:26,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 13 dim-0 vars, and 9 xjuncts. [2018-11-28 22:46:26,030 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2018-11-28 22:46:26,516 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2018-11-28 22:46:26,530 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:46:26,530 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:46:26,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-28 22:46:26,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:26,622 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:46:26,624 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:46:26,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-28 22:46:26,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:26,729 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:46:26,744 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:46:26,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-28 22:46:26,746 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:26,854 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:46:26,855 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:46:26,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-28 22:46:26,857 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:26,955 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:46:26,956 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:46:26,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-28 22:46:26,957 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:27,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2018-11-28 22:46:27,030 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:94, output treesize:33 [2018-11-28 22:46:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:27,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:46:27,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-11-28 22:46:27,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 22:46:27,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 22:46:27,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-11-28 22:46:27,505 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 21 states. [2018-11-28 22:46:28,747 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2018-11-28 22:46:29,103 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2018-11-28 22:46:29,356 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 50 [2018-11-28 22:46:30,525 WARN L180 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 56 [2018-11-28 22:46:31,403 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2018-11-28 22:46:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:32,141 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-28 22:46:32,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:46:32,144 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-11-28 22:46:32,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:32,145 INFO L225 Difference]: With dead ends: 68 [2018-11-28 22:46:32,145 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 22:46:32,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2018-11-28 22:46:32,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 22:46:32,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-11-28 22:46:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 22:46:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-11-28 22:46:32,149 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 28 [2018-11-28 22:46:32,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:32,149 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-11-28 22:46:32,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 22:46:32,149 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-28 22:46:32,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:46:32,150 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:32,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:46:32,150 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 22:46:32,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:32,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1271123095, now seen corresponding path program 1 times [2018-11-28 22:46:32,151 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:46:32,151 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:46:32,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:32,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:46:32,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 22:46:32,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:32,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:32,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 22:46:32,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:46:32,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:32,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:32,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2018-11-28 22:46:32,412 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 22:46:32,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:46:32,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:32,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:32,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:32,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-28 22:46:32,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:32,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:32,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 22:46:32,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:32,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:32,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-28 22:46:32,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-28 22:46:32,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-28 22:46:32,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:32,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:32,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:46:32,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-11-28 22:46:32,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:46:32,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 22:46:32,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:46:32,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:46:32,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-11-28 22:46:32,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:32,615 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:46:32,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:46:32,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 22:46:32,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:46:32,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:46:32,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:46:32,618 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 9 states. [2018-11-28 22:46:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:35,263 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-11-28 22:46:35,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:46:35,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-28 22:46:35,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:35,266 INFO L225 Difference]: With dead ends: 81 [2018-11-28 22:46:35,266 INFO L226 Difference]: Without dead ends: 81 [2018-11-28 22:46:35,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:46:35,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-28 22:46:35,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2018-11-28 22:46:35,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 22:46:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-11-28 22:46:35,270 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 28 [2018-11-28 22:46:35,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:35,270 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-11-28 22:46:35,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:46:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-11-28 22:46:35,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:46:35,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:35,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:46:35,272 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 22:46:35,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:35,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1271123094, now seen corresponding path program 1 times [2018-11-28 22:46:35,272 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:46:35,272 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:46:35,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:46:35,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:46:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:46:35,394 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:46:35,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:46:35,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:46:35,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:46:35,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:46:35,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:46:35,396 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 3 states. [2018-11-28 22:46:35,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:46:35,537 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-28 22:46:35,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:46:35,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 22:46:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:46:35,540 INFO L225 Difference]: With dead ends: 60 [2018-11-28 22:46:35,540 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 22:46:35,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:46:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 22:46:35,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-28 22:46:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 22:46:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-28 22:46:35,548 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 28 [2018-11-28 22:46:35,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:46:35,548 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-28 22:46:35,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:46:35,548 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-28 22:46:35,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 22:46:35,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:46:35,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:46:35,549 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 22:46:35,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:46:35,552 INFO L82 PathProgramCache]: Analyzing trace with hash 179927279, now seen corresponding path program 1 times [2018-11-28 22:46:35,552 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:46:35,552 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:46:35,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:46:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 22:46:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (18)] Exception during sending of exit command (exit): Broken pipe [2018-11-28 22:46:35,973 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 22:46:35,995 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-11-28 22:46:36,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:46:36 BoogieIcfgContainer [2018-11-28 22:46:36,018 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:46:36,018 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:46:36,018 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:46:36,019 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:46:36,019 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:46:07" (3/4) ... [2018-11-28 22:46:36,028 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 22:46:36,029 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:46:36,030 INFO L168 Benchmark]: Toolchain (without parser) took 30391.24 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -135.1 MB). Peak memory consumption was 167.4 MB. Max. memory is 11.5 GB. [2018-11-28 22:46:36,030 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:46:36,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 688.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2018-11-28 22:46:36,032 INFO L168 Benchmark]: Boogie Preprocessor took 72.61 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 22:46:36,032 INFO L168 Benchmark]: RCFGBuilder took 1229.93 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: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. [2018-11-28 22:46:36,033 INFO L168 Benchmark]: TraceAbstraction took 28382.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -36.4 MB). Peak memory consumption was 141.9 MB. Max. memory is 11.5 GB. [2018-11-28 22:46:36,033 INFO L168 Benchmark]: Witness Printer took 10.72 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:46:36,045 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 688.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.61 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1229.93 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: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28382.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -36.4 MB). Peak memory consumption was 141.9 MB. Max. memory is 11.5 GB. * Witness Printer took 10.72 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 633]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 633. Possible FailurePath: [L635] struct item *list = ((void *)0); VAL [list={-2146959039:0}] [L637] CALL append(&list) VAL [plist={-2146959039:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={-2146959040:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={-2146959040:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L627] item->next = *plist VAL [\read(**plist)={0:0}, item={-2146959040:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L628] EXPR item->next VAL [item={-2146959040:0}, item->next={0:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2147483648:0}, item={-2146959040:0}, item->next={0:0}, malloc(sizeof *item)={-2146959040:0}, malloc(sizeof *item)={-2147483648:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2147483648:0}, item={-2146959040:0}, item->next={0:0}, malloc(sizeof *item)={-2146959040:0}, malloc(sizeof *item)={-2147483648:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L631] *plist = item VAL [item={-2146959040:0}, malloc(sizeof *item)={-2146959040:0}, malloc(sizeof *item)={-2147483648:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L637] RET append(&list) VAL [list={-2146959039:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] \read(*list) VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}] [L639] COND TRUE \read(*list) [L640] EXPR \read(*list) VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}] [L640] EXPR list->next VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}, list->next={0:0}] [L640] struct item *next = list->next; [L641] EXPR \read(*list) VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}, next={0:0}] [L641] free(list) VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}, next={0:0}] [L641] free(list) [L642] list = next VAL [list={-2146959039:0}, next={0:0}] [L644] \read(*list) VAL [\read(*list)={0:0}, list={-2146959039:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) [L649] return 0; [L635] struct item *list = ((void *)0); [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 84 locations, 39 error locations. UNSAFE Result, 28.3s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 15.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 677 SDtfs, 891 SDslu, 1763 SDs, 0 SdLazy, 2510 SolverSat, 133 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 261 SyntacticMatches, 3 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 52 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 351 ConstructedInterpolants, 44 QuantifiedInterpolants, 102672 SizeOfPredicates, 125 NumberOfNonLiveVariables, 1501 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...