./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety-realloc/array-realloc_true-valid-memsafety.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/array-memsafety-realloc/array-realloc_true-valid-memsafety.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 5ce6ab98ff3a344cbd8c93195b0f965c65d244bc ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 22:44:45,656 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:44:45,658 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:44:45,675 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:44:45,676 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:44:45,678 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:44:45,679 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:44:45,681 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:44:45,683 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:44:45,684 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:44:45,688 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:44:45,688 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:44:45,690 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:44:45,691 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:44:45,695 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:44:45,696 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:44:45,697 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:44:45,698 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:44:45,700 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:44:45,702 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:44:45,703 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:44:45,704 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:44:45,706 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:44:45,706 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:44:45,707 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:44:45,707 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:44:45,708 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:44:45,709 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:44:45,710 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:44:45,711 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:44:45,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:44:45,712 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:44:45,712 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:44:45,712 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:44:45,713 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:44:45,714 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:44:45,714 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:44:45,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:44:45,745 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:44:45,746 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:44:45,746 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:44:45,746 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:44:45,748 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:44:45,750 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:44:45,750 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:44:45,750 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:44:45,750 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:44:45,750 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:44:45,751 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:44:45,751 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:44:45,751 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:44:45,751 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:44:45,751 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:44:45,751 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:44:45,752 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:44:45,753 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:44:45,754 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:44:45,754 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:44:45,754 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:44:45,754 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:44:45,754 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:44:45,754 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:44:45,756 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:44:45,756 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:44:45,756 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:44:45,756 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 -> 5ce6ab98ff3a344cbd8c93195b0f965c65d244bc [2018-11-28 22:44:45,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:44:45,816 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:44:45,820 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:44:45,822 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:44:45,823 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:44:45,823 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety-realloc/array-realloc_true-valid-memsafety.i [2018-11-28 22:44:45,884 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8061cbec/6fad653d1d4642de9dbdeee7fcece385/FLAGec9b797e1 [2018-11-28 22:44:46,433 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:44:46,434 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety-realloc/array-realloc_true-valid-memsafety.i [2018-11-28 22:44:46,448 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8061cbec/6fad653d1d4642de9dbdeee7fcece385/FLAGec9b797e1 [2018-11-28 22:44:46,718 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8061cbec/6fad653d1d4642de9dbdeee7fcece385 [2018-11-28 22:44:46,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:44:46,723 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:44:46,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:44:46,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:44:46,728 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:44:46,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:44:46" (1/1) ... [2018-11-28 22:44:46,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eb4524b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:46, skipping insertion in model container [2018-11-28 22:44:46,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:44:46" (1/1) ... [2018-11-28 22:44:46,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:44:46,788 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:44:47,192 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:44:47,216 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:44:47,370 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:44:47,427 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:44:47,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:47 WrapperNode [2018-11-28 22:44:47,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:44:47,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:44:47,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:44:47,429 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:44:47,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:47" (1/1) ... [2018-11-28 22:44:47,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:47" (1/1) ... [2018-11-28 22:44:47,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:47" (1/1) ... [2018-11-28 22:44:47,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:47" (1/1) ... [2018-11-28 22:44:47,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:47" (1/1) ... [2018-11-28 22:44:47,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:47" (1/1) ... [2018-11-28 22:44:47,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:47" (1/1) ... [2018-11-28 22:44:47,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:44:47,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:44:47,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:44:47,530 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:44:47,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:47" (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:44:47,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:44:47,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:44:47,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 22:44:47,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 22:44:47,586 INFO L138 BoogieDeclarations]: Found implementation of procedure expandArray [2018-11-28 22:44:47,586 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:44:47,586 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc [2018-11-28 22:44:47,586 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 22:44:47,586 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 22:44:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:44:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:44:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:44:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:44:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:44:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:44:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:44:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:44:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:44:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:44:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:44:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:44:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:44:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:44:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:44:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:44:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:44:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:44:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:44:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:44:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:44:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:44:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:44:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:44:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:44:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:44:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:44:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:44:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:44:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:44:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:44:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:44:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:44:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:44:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:44:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:44:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:44:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:44:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:44:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:44:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:44:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:44:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:44:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:44:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:44:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:44:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:44:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:44:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:44:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:44:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:44:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:44:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:44:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:44:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:44:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:44:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:44:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:44:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-28 22:44:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:44:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:44:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-28 22:44:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:44:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:44:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-28 22:44:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:44:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:44:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:44:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:44:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:44:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:44:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:44:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:44:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:44:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:44:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:44:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:44:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:44:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:44:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:44:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:44:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:44:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:44:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:44:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:44:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:44:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:44:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:44:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:44:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:44:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:44:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:44:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:44:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:44:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:44:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:44:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:44:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:44:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:44:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:44:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:44:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:44:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:44:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 22:44:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure expandArray [2018-11-28 22:44:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc [2018-11-28 22:44:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 22:44:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 22:44:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 22:44:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:44:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:44:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 22:44:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:44:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:44:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:44:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 22:44:48,348 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:44:48,349 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 22:44:48,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:44:48 BoogieIcfgContainer [2018-11-28 22:44:48,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:44:48,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:44:48,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:44:48,354 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:44:48,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:44:46" (1/3) ... [2018-11-28 22:44:48,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab8c817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:44:48, skipping insertion in model container [2018-11-28 22:44:48,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:44:47" (2/3) ... [2018-11-28 22:44:48,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab8c817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:44:48, skipping insertion in model container [2018-11-28 22:44:48,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:44:48" (3/3) ... [2018-11-28 22:44:48,358 INFO L112 eAbstractionObserver]: Analyzing ICFG array-realloc_true-valid-memsafety.i [2018-11-28 22:44:48,368 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:44:48,375 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-11-28 22:44:48,394 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-11-28 22:44:48,420 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:44:48,421 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:44:48,421 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:44:48,422 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:44:48,422 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:44:48,422 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:44:48,422 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:44:48,422 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:44:48,423 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:44:48,438 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-28 22:44:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 22:44:48,447 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:48,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:48,450 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:48,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:48,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1337060371, now seen corresponding path program 1 times [2018-11-28 22:44:48,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:48,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:48,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:48,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:48,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:48,672 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:44:48,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:48,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:44:48,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:44:48,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:44:48,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:48,702 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2018-11-28 22:44:48,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:48,948 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-28 22:44:48,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:44:48,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-28 22:44:48,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:48,960 INFO L225 Difference]: With dead ends: 54 [2018-11-28 22:44:48,960 INFO L226 Difference]: Without dead ends: 50 [2018-11-28 22:44:48,962 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:44:48,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-28 22:44:49,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-11-28 22:44:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 22:44:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-28 22:44:49,008 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 8 [2018-11-28 22:44:49,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:49,009 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-28 22:44:49,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:44:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-28 22:44:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 22:44:49,011 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:49,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:49,011 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:49,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:49,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1337060387, now seen corresponding path program 1 times [2018-11-28 22:44:49,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:49,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:49,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:49,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:49,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:49,223 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:44:49,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:49,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:44:49,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:44:49,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:44:49,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:49,227 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 3 states. [2018-11-28 22:44:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:49,428 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-11-28 22:44:49,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:44:49,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-28 22:44:49,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:49,431 INFO L225 Difference]: With dead ends: 41 [2018-11-28 22:44:49,431 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 22:44:49,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:49,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 22:44:49,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-28 22:44:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 22:44:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-11-28 22:44:49,438 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 8 [2018-11-28 22:44:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:49,439 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-11-28 22:44:49,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:44:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-11-28 22:44:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 22:44:49,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:49,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:49,440 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:49,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:49,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1337060386, now seen corresponding path program 1 times [2018-11-28 22:44:49,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:49,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:49,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:49,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:49,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:49,516 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:44:49,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:49,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:44:49,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:44:49,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:44:49,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:49,518 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 3 states. [2018-11-28 22:44:49,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:49,614 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-28 22:44:49,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:44:49,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-28 22:44:49,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:49,617 INFO L225 Difference]: With dead ends: 40 [2018-11-28 22:44:49,617 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 22:44:49,618 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:44:49,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 22:44:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 22:44:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 22:44:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-11-28 22:44:49,623 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 8 [2018-11-28 22:44:49,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:49,624 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-11-28 22:44:49,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:44:49,624 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-11-28 22:44:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:44:49,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:49,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:49,625 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:49,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:49,625 INFO L82 PathProgramCache]: Analyzing trace with hash 719809101, now seen corresponding path program 1 times [2018-11-28 22:44:49,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:49,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:49,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:49,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:49,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:49,726 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:44:49,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:49,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:44:49,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:44:49,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:44:49,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:49,727 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2018-11-28 22:44:49,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:49,945 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-28 22:44:49,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:44:49,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 22:44:49,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:49,948 INFO L225 Difference]: With dead ends: 40 [2018-11-28 22:44:49,948 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 22:44:49,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:44:49,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 22:44:49,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 22:44:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 22:44:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-28 22:44:49,960 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 10 [2018-11-28 22:44:49,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:49,961 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-28 22:44:49,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:44:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-28 22:44:49,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 22:44:49,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:49,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:49,968 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:49,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:49,970 INFO L82 PathProgramCache]: Analyzing trace with hash -936723183, now seen corresponding path program 1 times [2018-11-28 22:44:49,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:49,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:49,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:49,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:49,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:50,266 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:44:50,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:50,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:44:50,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:44:50,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:44:50,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:44:50,271 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 5 states. [2018-11-28 22:44:50,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:50,432 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-28 22:44:50,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:44:50,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 22:44:50,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:50,435 INFO L225 Difference]: With dead ends: 51 [2018-11-28 22:44:50,435 INFO L226 Difference]: Without dead ends: 51 [2018-11-28 22:44:50,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:44:50,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-28 22:44:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2018-11-28 22:44:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 22:44:50,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-28 22:44:50,443 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 13 [2018-11-28 22:44:50,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:50,443 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-28 22:44:50,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:44:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-28 22:44:50,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 22:44:50,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:50,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:50,444 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:50,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:50,445 INFO L82 PathProgramCache]: Analyzing trace with hash -936723182, now seen corresponding path program 1 times [2018-11-28 22:44:50,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:50,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:50,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:50,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:50,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:50,625 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:44:50,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:50,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:44:50,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:44:50,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:44:50,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:44:50,627 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-11-28 22:44:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:50,804 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-28 22:44:50,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:44:50,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-28 22:44:50,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:50,808 INFO L225 Difference]: With dead ends: 47 [2018-11-28 22:44:50,808 INFO L226 Difference]: Without dead ends: 47 [2018-11-28 22:44:50,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:44:50,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-28 22:44:50,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-28 22:44:50,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 22:44:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-11-28 22:44:50,815 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13 [2018-11-28 22:44:50,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:50,816 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-28 22:44:50,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:44:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-28 22:44:50,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:44:50,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:50,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:50,819 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:50,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:50,819 INFO L82 PathProgramCache]: Analyzing trace with hash 460975757, now seen corresponding path program 1 times [2018-11-28 22:44:50,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:50,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:50,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:50,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:50,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:50,963 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:44:50,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:50,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:44:50,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:44:50,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:44:50,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:44:50,965 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 6 states. [2018-11-28 22:44:51,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:51,088 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-28 22:44:51,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:44:51,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-28 22:44:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:51,090 INFO L225 Difference]: With dead ends: 41 [2018-11-28 22:44:51,090 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 22:44:51,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:44:51,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 22:44:51,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-28 22:44:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 22:44:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-28 22:44:51,096 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 18 [2018-11-28 22:44:51,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:51,096 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-28 22:44:51,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:44:51,096 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-28 22:44:51,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 22:44:51,097 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:51,097 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] [2018-11-28 22:44:51,100 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:51,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:51,100 INFO L82 PathProgramCache]: Analyzing trace with hash -821654175, now seen corresponding path program 1 times [2018-11-28 22:44:51,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:51,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:51,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:51,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:51,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:51,218 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:44:51,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:51,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:44:51,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:44:51,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:44:51,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:44:51,221 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 5 states. [2018-11-28 22:44:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:51,350 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-11-28 22:44:51,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:44:51,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 22:44:51,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:51,353 INFO L225 Difference]: With dead ends: 41 [2018-11-28 22:44:51,353 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 22:44:51,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:44:51,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 22:44:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-28 22:44:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 22:44:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-28 22:44:51,359 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 20 [2018-11-28 22:44:51,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:51,360 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-28 22:44:51,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:44:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-28 22:44:51,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 22:44:51,361 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:51,361 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] [2018-11-28 22:44:51,361 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:51,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:51,362 INFO L82 PathProgramCache]: Analyzing trace with hash -821654174, now seen corresponding path program 1 times [2018-11-28 22:44:51,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:51,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:51,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:51,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:51,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:51,482 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:44:51,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:51,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:44:51,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:44:51,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:44:51,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:44:51,484 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 7 states. [2018-11-28 22:44:51,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:51,613 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-28 22:44:51,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:44:51,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-28 22:44:51,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:51,615 INFO L225 Difference]: With dead ends: 44 [2018-11-28 22:44:51,615 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 22:44:51,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:44:51,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 22:44:51,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-28 22:44:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 22:44:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-28 22:44:51,621 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 20 [2018-11-28 22:44:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:51,622 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-28 22:44:51,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:44:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-28 22:44:51,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 22:44:51,626 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:51,626 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] [2018-11-28 22:44:51,627 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:51,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:51,627 INFO L82 PathProgramCache]: Analyzing trace with hash -793025023, now seen corresponding path program 1 times [2018-11-28 22:44:51,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:51,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:51,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:51,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:51,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:51,828 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:44:51,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:51,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:44:51,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:44:51,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:44:51,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:44:51,830 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 7 states. [2018-11-28 22:44:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:51,990 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-28 22:44:51,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:44:51,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-28 22:44:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:51,993 INFO L225 Difference]: With dead ends: 42 [2018-11-28 22:44:51,993 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 22:44:51,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:44:51,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 22:44:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-28 22:44:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 22:44:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-28 22:44:52,000 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 20 [2018-11-28 22:44:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:52,000 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-28 22:44:52,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:44:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-28 22:44:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 22:44:52,001 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:52,001 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] [2018-11-28 22:44:52,002 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:52,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:52,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1186028055, now seen corresponding path program 1 times [2018-11-28 22:44:52,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:52,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:52,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:52,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:52,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:52,477 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:44:52,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:52,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 22:44:52,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:44:52,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:44:52,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:44:52,478 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 9 states. [2018-11-28 22:44:52,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:52,708 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-28 22:44:52,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 22:44:52,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-28 22:44:52,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:52,711 INFO L225 Difference]: With dead ends: 49 [2018-11-28 22:44:52,712 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 22:44:52,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-28 22:44:52,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 22:44:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-28 22:44:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 22:44:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-11-28 22:44:52,717 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 21 [2018-11-28 22:44:52,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:52,718 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-28 22:44:52,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:44:52,718 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-28 22:44:52,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 22:44:52,719 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:52,719 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] [2018-11-28 22:44:52,719 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:52,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:52,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1186028056, now seen corresponding path program 1 times [2018-11-28 22:44:52,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:52,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:52,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:52,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:52,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:53,103 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:44:53,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:53,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 22:44:53,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 22:44:53,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 22:44:53,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:44:53,105 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 11 states. [2018-11-28 22:44:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:53,626 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-28 22:44:53,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 22:44:53,629 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-11-28 22:44:53,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:53,630 INFO L225 Difference]: With dead ends: 44 [2018-11-28 22:44:53,630 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 22:44:53,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-11-28 22:44:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 22:44:53,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 22:44:53,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 22:44:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-28 22:44:53,635 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 21 [2018-11-28 22:44:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:53,635 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-28 22:44:53,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 22:44:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-28 22:44:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:44:53,636 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:53,637 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:44:53,637 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:53,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:53,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1614388196, now seen corresponding path program 1 times [2018-11-28 22:44:53,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:53,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:53,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:53,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:53,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:53,806 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:44:53,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:53,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:44:53,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:44:53,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:44:53,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:44:53,808 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2018-11-28 22:44:53,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:53,853 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-28 22:44:53,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:44:53,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-28 22:44:53,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:53,855 INFO L225 Difference]: With dead ends: 44 [2018-11-28 22:44:53,855 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 22:44:53,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:44:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 22:44:53,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 22:44:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 22:44:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-28 22:44:53,863 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 23 [2018-11-28 22:44:53,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:53,863 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-28 22:44:53,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:44:53,863 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-28 22:44:53,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 22:44:53,864 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:53,864 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:44:53,864 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:53,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:53,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2137735083, now seen corresponding path program 1 times [2018-11-28 22:44:53,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:53,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:53,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:53,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:53,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:54,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:54,114 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:44:54,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:54,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:54,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:54,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-28 22:44:54,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:44:54,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:44:54,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:44:54,279 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 5 states. [2018-11-28 22:44:54,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:54,684 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-28 22:44:54,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:44:54,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-28 22:44:54,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:54,686 INFO L225 Difference]: With dead ends: 43 [2018-11-28 22:44:54,687 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 22:44:54,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:44:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 22:44:54,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 22:44:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 22:44:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-28 22:44:54,691 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 27 [2018-11-28 22:44:54,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:54,691 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-28 22:44:54,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:44:54,691 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-28 22:44:54,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 22:44:54,692 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:54,692 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:44:54,693 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:54,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:54,693 INFO L82 PathProgramCache]: Analyzing trace with hash -2137735082, now seen corresponding path program 1 times [2018-11-28 22:44:54,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:54,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:54,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:54,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:54,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:54,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:54,987 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:44:54,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:55,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:55,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:55,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-28 22:44:55,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:44:55,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:44:55,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:44:55,180 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 9 states. [2018-11-28 22:44:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:55,409 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-28 22:44:55,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:44:55,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-11-28 22:44:55,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:55,418 INFO L225 Difference]: With dead ends: 42 [2018-11-28 22:44:55,418 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 22:44:55,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-28 22:44:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 22:44:55,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-28 22:44:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 22:44:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-28 22:44:55,423 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 27 [2018-11-28 22:44:55,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:55,424 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-28 22:44:55,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:44:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-28 22:44:55,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:44:55,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:55,426 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:44:55,426 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:55,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:55,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1845278138, now seen corresponding path program 1 times [2018-11-28 22:44:55,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:55,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:55,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:55,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:55,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:55,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:55,593 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:44:55,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:55,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:55,714 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:44:55,721 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:44:55,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:55,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:55,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:55,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-28 22:44:55,780 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:44:55,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 11 treesize of output 3 [2018-11-28 22:44:55,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:55,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:55,787 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:44:55,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-28 22:44:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:55,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:55,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2018-11-28 22:44:55,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 22:44:55,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 22:44:55,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:44:55,815 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 11 states. [2018-11-28 22:44:56,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:56,031 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-28 22:44:56,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 22:44:56,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-28 22:44:56,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:56,032 INFO L225 Difference]: With dead ends: 41 [2018-11-28 22:44:56,033 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 22:44:56,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-11-28 22:44:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 22:44:56,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-28 22:44:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 22:44:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-28 22:44:56,038 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 28 [2018-11-28 22:44:56,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:56,039 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-28 22:44:56,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 22:44:56,039 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-28 22:44:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 22:44:56,040 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:56,040 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:44:56,040 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:56,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:56,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1369047371, now seen corresponding path program 1 times [2018-11-28 22:44:56,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:56,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:56,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:56,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:56,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:56,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:56,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:44:56,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:56,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:56,435 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:44:56,441 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:44:56,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:56,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:56,452 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:44:56,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-11-28 22:44:56,479 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:44:56,481 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:44:56,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:56,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:56,488 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:44:56,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-28 22:44:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:56,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:56,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2018-11-28 22:44:56,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 22:44:56,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 22:44:56,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:44:56,511 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 11 states. [2018-11-28 22:44:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:56,781 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-28 22:44:56,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 22:44:56,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-28 22:44:56,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:56,784 INFO L225 Difference]: With dead ends: 40 [2018-11-28 22:44:56,784 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 22:44:56,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-28 22:44:56,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 22:44:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 22:44:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 22:44:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-28 22:44:56,791 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 29 [2018-11-28 22:44:56,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:56,791 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-28 22:44:56,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 22:44:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-28 22:44:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 22:44:56,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:56,792 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] [2018-11-28 22:44:56,792 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:44:56,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:56,795 INFO L82 PathProgramCache]: Analyzing trace with hash 509204521, now seen corresponding path program 1 times [2018-11-28 22:44:56,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:56,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:56,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:56,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:56,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:57,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:57,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:44:57,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:57,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:57,444 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:44:57,458 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:44:57,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:57,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:57,471 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:44:57,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2018-11-28 22:44:57,500 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 52 treesize of output 46 [2018-11-28 22:44:57,503 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 46 treesize of output 40 [2018-11-28 22:44:57,506 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:44:57,515 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:44:57,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:44:57,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:48 [2018-11-28 22:44:57,581 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 33 treesize of output 27 [2018-11-28 22:44:57,604 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 27 treesize of output 18 [2018-11-28 22:44:57,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:57,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:57,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:57,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:23 [2018-11-28 22:44:59,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:59,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:59,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2018-11-28 22:44:59,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 22:44:59,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 22:44:59,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=323, Unknown=2, NotChecked=0, Total=380 [2018-11-28 22:44:59,482 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 20 states. [2018-11-28 22:45:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:00,293 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-28 22:45:00,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 22:45:00,295 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-11-28 22:45:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:00,296 INFO L225 Difference]: With dead ends: 51 [2018-11-28 22:45:00,296 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 22:45:00,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=92, Invalid=506, Unknown=2, NotChecked=0, Total=600 [2018-11-28 22:45:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 22:45:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-28 22:45:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 22:45:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-28 22:45:00,301 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 30 [2018-11-28 22:45:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:00,301 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-28 22:45:00,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 22:45:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-28 22:45:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 22:45:00,304 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:00,304 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:45:00,304 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:45:00,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:00,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1280572541, now seen corresponding path program 1 times [2018-11-28 22:45:00,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:00,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:00,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:00,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:00,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 22:45:01,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:45:01,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:45:01,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:01,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:45:01,142 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:01,146 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:45:01,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:01,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:01,155 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:01,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-28 22:45:01,171 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:45:01,175 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:45:01,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:01,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:01,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:01,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-11-28 22:45:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 22:45:01,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:45:01,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-28 22:45:01,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:45:01,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:45:01,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:45:01,218 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 8 states. [2018-11-28 22:45:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:01,308 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-28 22:45:01,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:45:01,310 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-28 22:45:01,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:01,311 INFO L225 Difference]: With dead ends: 41 [2018-11-28 22:45:01,311 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 22:45:01,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-28 22:45:01,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 22:45:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 22:45:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 22:45:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-28 22:45:01,314 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 31 [2018-11-28 22:45:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:01,315 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-28 22:45:01,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:45:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-28 22:45:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 22:45:01,318 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:01,318 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:45:01,318 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:45:01,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:01,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2126891074, now seen corresponding path program 1 times [2018-11-28 22:45:01,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:01,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:01,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:01,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:01,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 22:45:01,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:45:01,689 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:45:01,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:01,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:45:01,769 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 9 treesize of output 1 [2018-11-28 22:45:01,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:01,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:01,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-28 22:45:01,852 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:45:01,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2018-11-28 22:45:01,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:01,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:01,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:01,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:13 [2018-11-28 22:45:01,910 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 13 treesize of output 8 [2018-11-28 22:45:01,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:01,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:01,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:8 [2018-11-28 22:45:02,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 22:45:02,056 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:45:02,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:02,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:02,228 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:02,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-11-28 22:45:02,317 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 19 [2018-11-28 22:45:02,320 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 19 treesize of output 10 [2018-11-28 22:45:02,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:02,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:02,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:02,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-11-28 22:45:02,920 WARN L854 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_realloc_#res.base| Int)) (let ((.cse0 (store |c_old(#valid)| |c_#Ultimate.C_realloc_ptr.base| 0))) (and (= (select .cse0 |#Ultimate.C_realloc_#res.base|) 0) (= |c_#valid| (store .cse0 |#Ultimate.C_realloc_#res.base| 1))))) is different from true [2018-11-28 22:45:02,956 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:45:02,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:45:02,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:45:02,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-11-28 22:45:02,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2018-11-28 22:45:02,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:02,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:02,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:45:02,977 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-28 22:45:02,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:45:02,982 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 17 treesize of output 21 [2018-11-28 22:45:02,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:02,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:03,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-28 22:45:03,020 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:40 [2018-11-28 22:45:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-11-28 22:45:03,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:45:03,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 24 [2018-11-28 22:45:03,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-28 22:45:03,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-28 22:45:03,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=483, Unknown=1, NotChecked=44, Total=600 [2018-11-28 22:45:03,121 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 25 states. [2018-11-28 22:45:04,429 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-11-28 22:45:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:04,767 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-28 22:45:04,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 22:45:04,768 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-11-28 22:45:04,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:04,769 INFO L225 Difference]: With dead ends: 38 [2018-11-28 22:45:04,770 INFO L226 Difference]: Without dead ends: 38 [2018-11-28 22:45:04,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=168, Invalid=957, Unknown=1, NotChecked=64, Total=1190 [2018-11-28 22:45:04,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-28 22:45:04,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-28 22:45:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 22:45:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-28 22:45:04,781 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 31 [2018-11-28 22:45:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:04,781 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-28 22:45:04,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-28 22:45:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-28 22:45:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 22:45:04,782 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:45:04,791 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:45:04,791 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION]=== [2018-11-28 22:45:04,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:45:04,792 INFO L82 PathProgramCache]: Analyzing trace with hash -10328478, now seen corresponding path program 2 times [2018-11-28 22:45:04,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:45:04,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:45:04,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:04,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:45:04,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:45:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:45:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 22:45:05,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:45:05,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:45:05,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:45:05,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:45:05,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:45:05,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:45:05,757 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:05,760 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:05,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:05,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:05,775 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:05,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:40 [2018-11-28 22:45:05,838 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2018-11-28 22:45:05,846 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 35 treesize of output 26 [2018-11-28 22:45:05,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:05,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:05,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:05,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2018-11-28 22:45:07,334 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:07,353 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:07,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:07,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:07,405 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:07,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2018-11-28 22:45:07,436 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 52 treesize of output 46 [2018-11-28 22:45:07,439 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 46 treesize of output 40 [2018-11-28 22:45:07,440 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:45:07,447 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:45:07,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:45:07,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:48 [2018-11-28 22:45:07,498 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 33 treesize of output 27 [2018-11-28 22:45:07,510 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 27 treesize of output 18 [2018-11-28 22:45:07,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:45:07,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:45:07,596 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:07,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:23 [2018-11-28 22:45:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 22:45:09,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:45:09,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-11-28 22:45:09,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 22:45:09,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 22:45:09,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=477, Unknown=3, NotChecked=0, Total=552 [2018-11-28 22:45:09,802 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 24 states. [2018-11-28 22:45:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:45:10,506 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-28 22:45:10,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 22:45:10,507 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 40 [2018-11-28 22:45:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:45:10,507 INFO L225 Difference]: With dead ends: 37 [2018-11-28 22:45:10,508 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 22:45:10,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=128, Invalid=739, Unknown=3, NotChecked=0, Total=870 [2018-11-28 22:45:10,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 22:45:10,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 22:45:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 22:45:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 22:45:10,509 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-11-28 22:45:10,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:45:10,510 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 22:45:10,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 22:45:10,510 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 22:45:10,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 22:45:10,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:45:10 BoogieIcfgContainer [2018-11-28 22:45:10,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:45:10,516 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:45:10,516 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:45:10,516 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:45:10,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:44:48" (3/4) ... [2018-11-28 22:45:10,521 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 22:45:10,528 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 22:45:10,528 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_realloc [2018-11-28 22:45:10,528 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 22:45:10,528 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 22:45:10,528 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure expandArray [2018-11-28 22:45:10,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 22:45:10,537 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-28 22:45:10,537 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-28 22:45:10,537 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 22:45:10,538 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 22:45:10,594 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 22:45:10,594 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:45:10,596 INFO L168 Benchmark]: Toolchain (without parser) took 23873.41 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.3 MB). Free memory was 951.4 MB in the beginning and 834.8 MB in the end (delta: 116.5 MB). Peak memory consumption was 403.8 MB. Max. memory is 11.5 GB. [2018-11-28 22:45:10,597 INFO L168 Benchmark]: CDTParser took 0.16 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:45:10,597 INFO L168 Benchmark]: CACSL2BoogieTranslator took 704.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-11-28 22:45:10,598 INFO L168 Benchmark]: Boogie Preprocessor took 99.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:45:10,598 INFO L168 Benchmark]: RCFGBuilder took 820.33 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: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. [2018-11-28 22:45:10,598 INFO L168 Benchmark]: TraceAbstraction took 22165.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.5 MB). Free memory was 1.1 GB in the beginning and 843.7 MB in the end (delta: 219.3 MB). Peak memory consumption was 370.8 MB. Max. memory is 11.5 GB. [2018-11-28 22:45:10,599 INFO L168 Benchmark]: Witness Printer took 77.72 ms. Allocated memory is still 1.3 GB. Free memory was 843.7 MB in the beginning and 834.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2018-11-28 22:45:10,604 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.16 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 704.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 820.33 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: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22165.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.5 MB). Free memory was 1.1 GB in the beginning and 843.7 MB in the end (delta: 219.3 MB). Peak memory consumption was 370.8 MB. Max. memory is 11.5 GB. * Witness Printer took 77.72 ms. Allocated memory is still 1.3 GB. Free memory was 843.7 MB in the beginning and 834.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 570]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 562]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 562]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 51 locations, 13 error locations. SAFE Result, 22.1s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 650 SDtfs, 432 SDslu, 1893 SDs, 0 SdLazy, 1953 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 218 SyntacticMatches, 22 SemanticMatches, 197 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=6, 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, 21 MinimizatonAttempts, 22 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 660 ConstructedInterpolants, 8 QuantifiedInterpolants, 138709 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1821 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 29 InterpolantComputations, 13 PerfectInterpolantSequences, 37/74 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...