./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa 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/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.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 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:58:49,281 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:58:49,283 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:58:49,295 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:58:49,296 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:58:49,297 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:58:49,298 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:58:49,300 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:58:49,302 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:58:49,303 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:58:49,304 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:58:49,305 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:58:49,306 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:58:49,307 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:58:49,308 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:58:49,309 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:58:49,310 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:58:49,312 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:58:49,315 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:58:49,317 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:58:49,318 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:58:49,322 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:58:49,324 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:58:49,326 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:58:49,326 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:58:49,329 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:58:49,331 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:58:49,331 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:58:49,335 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:58:49,336 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:58:49,336 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:58:49,337 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:58:49,337 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:58:49,337 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:58:49,338 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:58:49,339 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:58:49,339 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 17:58:49,354 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:58:49,354 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:58:49,356 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:58:49,356 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:58:49,356 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:58:49,356 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:58:49,356 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:58:49,357 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:58:49,357 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:58:49,357 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:58:49,357 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:58:49,357 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:58:49,357 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:58:49,358 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:58:49,358 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:58:49,358 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:58:49,358 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:58:49,358 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:58:49,359 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:58:49,359 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:58:49,359 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:58:49,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:58:49,359 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:58:49,359 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:58:49,360 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:58:49,360 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:58:49,360 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 -> 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b [2019-01-01 17:58:49,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:58:49,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:58:49,432 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:58:49,434 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:58:49,435 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:58:49,435 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2019-01-01 17:58:49,508 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/196e6f4f5/029ec0371894435ba1f8edca318bd5ed/FLAG898af2bd7 [2019-01-01 17:58:50,090 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:58:50,090 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2019-01-01 17:58:50,116 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/196e6f4f5/029ec0371894435ba1f8edca318bd5ed/FLAG898af2bd7 [2019-01-01 17:58:50,380 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/196e6f4f5/029ec0371894435ba1f8edca318bd5ed [2019-01-01 17:58:50,384 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:58:50,386 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:58:50,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:58:50,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:58:50,392 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:58:50,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:58:50" (1/1) ... [2019-01-01 17:58:50,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22eac36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:50, skipping insertion in model container [2019-01-01 17:58:50,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:58:50" (1/1) ... [2019-01-01 17:58:50,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:58:50,463 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:58:50,829 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:58:50,846 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:58:50,995 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:58:51,066 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:58:51,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:51 WrapperNode [2019-01-01 17:58:51,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:58:51,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:58:51,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:58:51,067 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:58:51,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:51" (1/1) ... [2019-01-01 17:58:51,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:51" (1/1) ... [2019-01-01 17:58:51,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:51" (1/1) ... [2019-01-01 17:58:51,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:51" (1/1) ... [2019-01-01 17:58:51,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:51" (1/1) ... [2019-01-01 17:58:51,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:51" (1/1) ... [2019-01-01 17:58:51,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:51" (1/1) ... [2019-01-01 17:58:51,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:58:51,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:58:51,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:58:51,125 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:58:51,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:58:51,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:58:51,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:58:51,182 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-01-01 17:58:51,182 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-01-01 17:58:51,182 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:58:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 17:58:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:58:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:58:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:58:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:58:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:58:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:58:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:58:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:58:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:58:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:58:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:58:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:58:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:58:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:58:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:58:51,187 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:58:51,187 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:58:51,187 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:58:51,187 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:58:51,187 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:58:51,188 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:58:51,188 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:58:51,188 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:58:51,188 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:58:51,188 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:58:51,188 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:58:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:58:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:58:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:58:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:58:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:58:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:58:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:58:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:58:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:58:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:58:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:58:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:58:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:58:51,195 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:58:51,195 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:58:51,195 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:58:51,195 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:58:51,195 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:58:51,195 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:58:51,195 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:58:51,198 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:58:51,198 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:58:51,198 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:58:51,198 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:58:51,198 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:58:51,198 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:58:51,199 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:58:51,199 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:58:51,200 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:58:51,200 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:58:51,200 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:58:51,200 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:58:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:58:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:58:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:58:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:58:51,203 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:58:51,203 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:58:51,203 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-01 17:58:51,204 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:58:51,204 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:58:51,204 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:58:51,204 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:58:51,205 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:58:51,206 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:58:51,206 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:58:51,206 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:58:51,206 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:58:51,206 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:58:51,207 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:58:51,208 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:58:51,208 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:58:51,209 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:58:51,209 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:58:51,209 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:58:51,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:58:51,209 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:58:51,209 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:58:51,209 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:58:51,209 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:58:51,212 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:58:51,212 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:58:51,212 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:58:51,212 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:58:51,212 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:58:51,213 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:58:51,213 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:58:51,213 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:58:51,213 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:58:51,213 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:58:51,213 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:58:51,213 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:58:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:58:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:58:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:58:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-01-01 17:58:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 17:58:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 17:58:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 17:58:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 17:58:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-01-01 17:58:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 17:58:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:58:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:58:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:58:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:58:51,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:58:51,963 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:58:51,963 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-01 17:58:51,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:58:51 BoogieIcfgContainer [2019-01-01 17:58:51,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:58:51,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:58:51,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:58:51,970 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:58:51,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:58:50" (1/3) ... [2019-01-01 17:58:51,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a397b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:58:51, skipping insertion in model container [2019-01-01 17:58:51,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:51" (2/3) ... [2019-01-01 17:58:51,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a397b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:58:51, skipping insertion in model container [2019-01-01 17:58:51,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:58:51" (3/3) ... [2019-01-01 17:58:51,975 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2019-01-01 17:58:51,986 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:58:51,996 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-01-01 17:58:52,016 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-01-01 17:58:52,047 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:58:52,048 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:58:52,048 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:58:52,049 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:58:52,055 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:58:52,055 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:58:52,056 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:58:52,056 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:58:52,056 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:58:52,086 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-01-01 17:58:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:58:52,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:52,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:58:52,110 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION]=== [2019-01-01 17:58:52,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:52,122 INFO L82 PathProgramCache]: Analyzing trace with hash -515788903, now seen corresponding path program 1 times [2019-01-01 17:58:52,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:52,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:52,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:52,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:52,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:58:52,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:52,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:58:52,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:58:52,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:58:52,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:58:52,470 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 5 states. [2019-01-01 17:58:53,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:53,429 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-01 17:58:53,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:58:53,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-01 17:58:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:53,441 INFO L225 Difference]: With dead ends: 70 [2019-01-01 17:58:53,441 INFO L226 Difference]: Without dead ends: 67 [2019-01-01 17:58:53,443 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 [2019-01-01 17:58:53,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-01 17:58:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-01 17:58:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-01 17:58:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-01 17:58:53,486 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 9 [2019-01-01 17:58:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:53,486 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-01 17:58:53,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:58:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-01 17:58:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:58:53,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:53,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:58:53,488 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION]=== [2019-01-01 17:58:53,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:53,488 INFO L82 PathProgramCache]: Analyzing trace with hash -515788902, now seen corresponding path program 1 times [2019-01-01 17:58:53,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:53,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:53,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:53,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:53,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:53,659 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 17:58:53,813 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 17:58:53,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:58:53,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:53,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:58:53,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:58:53,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:58:53,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:58:53,891 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 5 states. [2019-01-01 17:58:54,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:54,211 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-01 17:58:54,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:58:54,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-01 17:58:54,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:54,215 INFO L225 Difference]: With dead ends: 66 [2019-01-01 17:58:54,215 INFO L226 Difference]: Without dead ends: 66 [2019-01-01 17:58:54,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:58:54,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-01 17:58:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-01 17:58:54,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-01 17:58:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-01 17:58:54,224 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 9 [2019-01-01 17:58:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:54,225 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-01 17:58:54,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:58:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-01 17:58:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 17:58:54,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:54,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:58:54,226 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION]=== [2019-01-01 17:58:54,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:54,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1751897317, now seen corresponding path program 1 times [2019-01-01 17:58:54,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:54,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:54,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:54,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:54,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:58:54,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:54,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:58:54,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:58:54,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:58:54,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:58:54,393 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 6 states. [2019-01-01 17:58:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:54,595 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-01 17:58:54,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:58:54,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-01 17:58:54,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:54,600 INFO L225 Difference]: With dead ends: 63 [2019-01-01 17:58:54,600 INFO L226 Difference]: Without dead ends: 63 [2019-01-01 17:58:54,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:58:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-01 17:58:54,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-01 17:58:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-01 17:58:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-01 17:58:54,609 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 11 [2019-01-01 17:58:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:54,610 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-01 17:58:54,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:58:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-01 17:58:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 17:58:54,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:54,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:58:54,611 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION]=== [2019-01-01 17:58:54,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:54,611 INFO L82 PathProgramCache]: Analyzing trace with hash 53856989, now seen corresponding path program 1 times [2019-01-01 17:58:54,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:54,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:54,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:54,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:54,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:58:54,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:54,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:58:54,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:58:54,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:58:54,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:58:54,747 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 5 states. [2019-01-01 17:58:54,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:54,959 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-01 17:58:54,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:58:54,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-01 17:58:54,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:54,962 INFO L225 Difference]: With dead ends: 62 [2019-01-01 17:58:54,962 INFO L226 Difference]: Without dead ends: 62 [2019-01-01 17:58:54,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:58:54,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-01 17:58:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-01 17:58:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-01 17:58:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-01 17:58:54,969 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 13 [2019-01-01 17:58:54,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:54,970 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-01 17:58:54,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:58:54,970 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-01 17:58:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 17:58:54,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:54,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:58:54,971 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION]=== [2019-01-01 17:58:54,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:54,972 INFO L82 PathProgramCache]: Analyzing trace with hash 53856990, now seen corresponding path program 1 times [2019-01-01 17:58:54,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:54,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:54,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:54,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:54,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:58:55,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:55,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:58:55,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:58:55,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:58:55,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:58:55,202 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 6 states. [2019-01-01 17:58:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:55,456 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-01 17:58:55,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:58:55,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-01-01 17:58:55,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:55,458 INFO L225 Difference]: With dead ends: 61 [2019-01-01 17:58:55,459 INFO L226 Difference]: Without dead ends: 61 [2019-01-01 17:58:55,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:58:55,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-01 17:58:55,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-01 17:58:55,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-01 17:58:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-01 17:58:55,468 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 13 [2019-01-01 17:58:55,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:55,468 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-01 17:58:55,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:58:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-01 17:58:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:58:55,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:55,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:58:55,470 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION]=== [2019-01-01 17:58:55,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:55,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1864217314, now seen corresponding path program 1 times [2019-01-01 17:58:55,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:55,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:55,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:55,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:55,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:58:55,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:55,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 17:58:55,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 17:58:55,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 17:58:55,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:58:55,720 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 11 states. [2019-01-01 17:58:56,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:56,214 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-01 17:58:56,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 17:58:56,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-01 17:58:56,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:56,219 INFO L225 Difference]: With dead ends: 60 [2019-01-01 17:58:56,219 INFO L226 Difference]: Without dead ends: 60 [2019-01-01 17:58:56,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-01-01 17:58:56,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-01 17:58:56,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-01 17:58:56,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-01 17:58:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-01 17:58:56,226 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 16 [2019-01-01 17:58:56,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:56,226 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-01 17:58:56,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 17:58:56,227 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-01 17:58:56,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:58:56,227 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:56,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:58:56,228 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION]=== [2019-01-01 17:58:56,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:56,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1864217313, now seen corresponding path program 1 times [2019-01-01 17:58:56,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:56,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:56,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:56,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:56,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:58:56,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:56,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 17:58:56,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 17:58:56,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 17:58:56,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:58:56,535 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 11 states. [2019-01-01 17:58:57,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:57,230 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-01 17:58:57,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 17:58:57,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-01 17:58:57,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:57,233 INFO L225 Difference]: With dead ends: 59 [2019-01-01 17:58:57,233 INFO L226 Difference]: Without dead ends: 59 [2019-01-01 17:58:57,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-01-01 17:58:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-01 17:58:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-01 17:58:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-01 17:58:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-01 17:58:57,239 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 16 [2019-01-01 17:58:57,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:57,240 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-01 17:58:57,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 17:58:57,240 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-01 17:58:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:58:57,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:57,241 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] [2019-01-01 17:58:57,241 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION]=== [2019-01-01 17:58:57,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:57,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1351600001, now seen corresponding path program 1 times [2019-01-01 17:58:57,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:57,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:57,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:57,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:57,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:58:57,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:57,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:58:57,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:58:57,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:58:57,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:58:57,498 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 8 states. [2019-01-01 17:58:57,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:57,775 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-01 17:58:57,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:58:57,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-01-01 17:58:57,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:57,777 INFO L225 Difference]: With dead ends: 63 [2019-01-01 17:58:57,777 INFO L226 Difference]: Without dead ends: 63 [2019-01-01 17:58:57,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:58:57,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-01 17:58:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-01-01 17:58:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-01 17:58:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-01 17:58:57,784 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 22 [2019-01-01 17:58:57,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:57,785 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-01 17:58:57,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:58:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-01 17:58:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:58:57,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:57,786 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] [2019-01-01 17:58:57,786 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION]=== [2019-01-01 17:58:57,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:57,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1351600002, now seen corresponding path program 1 times [2019-01-01 17:58:57,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:57,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:57,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:57,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:57,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:58:57,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:57,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 17:58:57,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 17:58:57,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 17:58:57,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:58:58,000 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 9 states. [2019-01-01 17:58:58,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:58,162 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-01 17:58:58,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:58:58,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-01-01 17:58:58,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:58,165 INFO L225 Difference]: With dead ends: 53 [2019-01-01 17:58:58,165 INFO L226 Difference]: Without dead ends: 53 [2019-01-01 17:58:58,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:58:58,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-01 17:58:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-01 17:58:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-01 17:58:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-01 17:58:58,170 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 22 [2019-01-01 17:58:58,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:58,171 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-01 17:58:58,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 17:58:58,171 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-01 17:58:58,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 17:58:58,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:58,172 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] [2019-01-01 17:58:58,172 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION]=== [2019-01-01 17:58:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:58,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1819311235, now seen corresponding path program 1 times [2019-01-01 17:58:58,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:58,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:58,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:58,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:58,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:58,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:58:58,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:58,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-01 17:58:58,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 17:58:58,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 17:58:58,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-01-01 17:58:58,681 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 16 states. [2019-01-01 17:58:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:59,717 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-01 17:58:59,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 17:58:59,718 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-01-01 17:58:59,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:59,721 INFO L225 Difference]: With dead ends: 54 [2019-01-01 17:58:59,722 INFO L226 Difference]: Without dead ends: 54 [2019-01-01 17:58:59,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-01-01 17:58:59,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-01 17:58:59,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-01-01 17:58:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-01 17:58:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-01 17:58:59,727 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26 [2019-01-01 17:58:59,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:59,727 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-01 17:58:59,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 17:58:59,727 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-01 17:58:59,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 17:58:59,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:59,736 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] [2019-01-01 17:58:59,737 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION]=== [2019-01-01 17:58:59,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:59,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1819311236, now seen corresponding path program 1 times [2019-01-01 17:58:59,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:59,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:59,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:59,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:59,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:00,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:00,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-01 17:59:00,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 17:59:00,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 17:59:00,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-01-01 17:59:00,407 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 16 states. [2019-01-01 17:59:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:01,474 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-01 17:59:01,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 17:59:01,476 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-01-01 17:59:01,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:01,478 INFO L225 Difference]: With dead ends: 49 [2019-01-01 17:59:01,478 INFO L226 Difference]: Without dead ends: 49 [2019-01-01 17:59:01,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-01-01 17:59:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-01 17:59:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-01 17:59:01,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-01 17:59:01,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-01 17:59:01,486 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 26 [2019-01-01 17:59:01,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:01,486 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-01 17:59:01,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 17:59:01,486 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-01 17:59:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 17:59:01,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:01,487 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] [2019-01-01 17:59:01,487 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION]=== [2019-01-01 17:59:01,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:01,490 INFO L82 PathProgramCache]: Analyzing trace with hash 564073450, now seen corresponding path program 1 times [2019-01-01 17:59:01,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:01,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:01,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:01,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:01,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:02,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:02,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-01 17:59:02,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 17:59:02,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 17:59:02,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-01-01 17:59:02,159 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 16 states. [2019-01-01 17:59:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:03,350 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-01 17:59:03,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 17:59:03,351 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-01-01 17:59:03,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:03,353 INFO L225 Difference]: With dead ends: 51 [2019-01-01 17:59:03,353 INFO L226 Difference]: Without dead ends: 51 [2019-01-01 17:59:03,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2019-01-01 17:59:03,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-01 17:59:03,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-01-01 17:59:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-01 17:59:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-01 17:59:03,358 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 27 [2019-01-01 17:59:03,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:03,358 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-01 17:59:03,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 17:59:03,358 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-01 17:59:03,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 17:59:03,359 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:03,359 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] [2019-01-01 17:59:03,360 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION]=== [2019-01-01 17:59:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:03,360 INFO L82 PathProgramCache]: Analyzing trace with hash 564073451, now seen corresponding path program 1 times [2019-01-01 17:59:03,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:03,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:03,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:03,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:03,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:04,023 WARN L181 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2019-01-01 17:59:04,360 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2019-01-01 17:59:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:04,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:04,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-01 17:59:04,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 17:59:04,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 17:59:04,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-01-01 17:59:04,811 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 16 states. [2019-01-01 17:59:05,245 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-01 17:59:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:06,528 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-01 17:59:06,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 17:59:06,529 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-01-01 17:59:06,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:06,529 INFO L225 Difference]: With dead ends: 46 [2019-01-01 17:59:06,529 INFO L226 Difference]: Without dead ends: 46 [2019-01-01 17:59:06,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2019-01-01 17:59:06,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-01 17:59:06,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-01 17:59:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 17:59:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-01 17:59:06,533 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 27 [2019-01-01 17:59:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:06,533 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-01 17:59:06,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 17:59:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-01 17:59:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 17:59:06,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:06,536 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] [2019-01-01 17:59:06,537 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION]=== [2019-01-01 17:59:06,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:06,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1894862360, now seen corresponding path program 1 times [2019-01-01 17:59:06,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:06,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:06,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:06,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:06,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:07,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:07,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-01 17:59:07,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 17:59:07,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 17:59:07,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-01 17:59:07,236 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 16 states. [2019-01-01 17:59:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:08,057 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-01 17:59:08,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 17:59:08,058 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-01 17:59:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:08,059 INFO L225 Difference]: With dead ends: 45 [2019-01-01 17:59:08,059 INFO L226 Difference]: Without dead ends: 45 [2019-01-01 17:59:08,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-01-01 17:59:08,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-01 17:59:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-01 17:59:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-01 17:59:08,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-01 17:59:08,063 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 30 [2019-01-01 17:59:08,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:08,063 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-01 17:59:08,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 17:59:08,064 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-01 17:59:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-01 17:59:08,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:08,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:08,065 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION]=== [2019-01-01 17:59:08,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:08,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1089311954, now seen corresponding path program 1 times [2019-01-01 17:59:08,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:08,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:08,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:08,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:08,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:08,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:08,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-01 17:59:08,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 17:59:08,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 17:59:08,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-01-01 17:59:08,564 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 16 states. [2019-01-01 17:59:09,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:09,272 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-01 17:59:09,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 17:59:09,273 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2019-01-01 17:59:09,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:09,274 INFO L225 Difference]: With dead ends: 44 [2019-01-01 17:59:09,274 INFO L226 Difference]: Without dead ends: 44 [2019-01-01 17:59:09,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2019-01-01 17:59:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-01 17:59:09,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-01 17:59:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-01 17:59:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-01 17:59:09,279 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 33 [2019-01-01 17:59:09,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:09,279 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-01 17:59:09,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 17:59:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-01 17:59:09,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 17:59:09,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:09,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:09,280 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION]=== [2019-01-01 17:59:09,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:09,281 INFO L82 PathProgramCache]: Analyzing trace with hash 591067884, now seen corresponding path program 1 times [2019-01-01 17:59:09,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:09,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:09,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:09,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:09,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:09,724 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-01-01 17:59:09,953 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2019-01-01 17:59:10,196 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-01-01 17:59:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:10,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:10,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-01-01 17:59:10,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 17:59:10,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 17:59:10,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-01-01 17:59:10,501 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 20 states. [2019-01-01 17:59:11,039 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-01-01 17:59:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:11,956 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-01 17:59:11,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-01 17:59:11,958 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-01-01 17:59:11,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:11,959 INFO L225 Difference]: With dead ends: 46 [2019-01-01 17:59:11,959 INFO L226 Difference]: Without dead ends: 46 [2019-01-01 17:59:11,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 17:59:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-01 17:59:11,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-01-01 17:59:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 17:59:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-01 17:59:11,964 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 34 [2019-01-01 17:59:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:11,964 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-01 17:59:11,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 17:59:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-01 17:59:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 17:59:11,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:11,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:11,966 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION]=== [2019-01-01 17:59:11,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:11,966 INFO L82 PathProgramCache]: Analyzing trace with hash 546373601, now seen corresponding path program 1 times [2019-01-01 17:59:11,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:11,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:11,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 17:59:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 17:59:12,052 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 17:59:12,082 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-01 17:59:12,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:59:12 BoogieIcfgContainer [2019-01-01 17:59:12,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:59:12,101 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:59:12,101 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:59:12,101 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:59:12,101 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:58:51" (3/4) ... [2019-01-01 17:59:12,106 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 17:59:12,106 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:59:12,107 INFO L168 Benchmark]: Toolchain (without parser) took 21721.75 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 351.3 MB). Free memory was 942.0 MB in the beginning and 1.2 GB in the end (delta: -272.9 MB). Peak memory consumption was 78.3 MB. Max. memory is 11.5 GB. [2019-01-01 17:59:12,108 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:59:12,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 679.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-01 17:59:12,109 INFO L168 Benchmark]: Boogie Preprocessor took 57.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:59:12,110 INFO L168 Benchmark]: RCFGBuilder took 839.37 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: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. [2019-01-01 17:59:12,111 INFO L168 Benchmark]: TraceAbstraction took 20135.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 207.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -147.4 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. [2019-01-01 17:59:12,112 INFO L168 Benchmark]: Witness Printer took 5.32 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:59:12,116 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.74 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 679.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.44 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 839.37 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: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20135.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 207.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -147.4 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.32 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] TData data; VAL [data={-3:0}] [L643] CALL alloc_data(&data) VAL [pdata={-3:0}] [L625] pdata->lo = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={-1:0}, pdata={-3:0}, pdata={-3:0}] [L626] pdata->hi = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={-1:0}, malloc(sizeof(int))={1:0}, pdata={-3:0}, pdata={-3:0}] [L627] EXPR pdata->lo VAL [malloc(sizeof(int))={-1:0}, malloc(sizeof(int))={1:0}, pdata={-3:0}, pdata={-3:0}, pdata->lo={-1:0}] [L627] *(pdata->lo) = 4 VAL [malloc(sizeof(int))={-1:0}, malloc(sizeof(int))={1:0}, pdata={-3:0}, pdata={-3:0}, pdata->lo={-1:0}] [L628] EXPR pdata->hi VAL [malloc(sizeof(int))={-1:0}, malloc(sizeof(int))={1:0}, pdata={-3:0}, pdata={-3:0}, pdata->hi={1:0}] [L628] *(pdata->hi) = 8 VAL [malloc(sizeof(int))={-1:0}, malloc(sizeof(int))={1:0}, pdata={-3:0}, pdata={-3:0}, pdata->hi={1:0}] [L643] RET alloc_data(&data) VAL [data={-3:0}] [L644] CALL free_data(&data) VAL [data={-3:0}] [L632] EXPR data->lo VAL [data={-3:0}, data={-3:0}, data->lo={-1:0}] [L632] int *lo = data->lo; [L633] EXPR data->hi VAL [data={-3:0}, data={-3:0}, data->hi={1:0}, lo={-1:0}] [L633] int *hi = data->hi; [L634] EXPR \read(*lo) VAL [\read(*lo)=4, data={-3:0}, data={-3:0}, hi={1:0}, lo={-1:0}] [L634] EXPR \read(*hi) VAL [\read(*hi)=8, \read(*lo)=4, data={-3:0}, data={-3:0}, hi={1:0}, lo={-1:0}] [L634] COND FALSE !(*lo >= *hi) [L638] data->lo = ((void *)0) VAL [data={-3:0}, data={-3:0}, hi={1:0}, lo={-1:0}] [L639] data->hi = ((void *)0) VAL [data={-3:0}, data={-3:0}, hi={1:0}, lo={-1:0}] [L644] RET free_data(&data) VAL [data={-3:0}] [L645] return 0; [L645] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 74 locations, 31 error locations. UNSAFE Result, 20.0s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 11.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 584 SDtfs, 705 SDslu, 2632 SDs, 0 SdLazy, 3391 SolverSat, 210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 96862 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:59:14,470 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:59:14,472 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:59:14,484 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:59:14,484 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:59:14,485 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:59:14,487 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:59:14,489 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:59:14,491 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:59:14,492 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:59:14,493 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:59:14,493 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:59:14,495 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:59:14,495 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:59:14,497 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:59:14,497 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:59:14,498 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:59:14,501 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:59:14,503 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:59:14,505 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:59:14,506 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:59:14,507 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:59:14,510 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:59:14,510 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:59:14,510 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:59:14,511 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:59:14,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:59:14,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:59:14,514 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:59:14,516 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:59:14,516 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:59:14,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:59:14,517 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:59:14,518 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:59:14,519 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:59:14,519 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:59:14,519 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-01 17:59:14,535 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:59:14,536 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:59:14,537 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:59:14,537 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:59:14,537 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:59:14,538 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:59:14,538 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:59:14,539 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:59:14,539 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:59:14,539 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:59:14,539 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:59:14,539 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:59:14,539 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:59:14,539 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:59:14,540 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:59:14,540 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-01 17:59:14,540 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-01 17:59:14,540 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:59:14,540 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:59:14,541 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:59:14,542 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:59:14,542 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:59:14,542 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:59:14,543 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:59:14,543 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:59:14,543 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:59:14,544 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-01 17:59:14,544 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:59:14,544 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-01 17:59:14,544 INFO L133 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b [2019-01-01 17:59:14,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:59:14,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:59:14,605 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:59:14,607 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:59:14,607 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:59:14,608 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2019-01-01 17:59:14,675 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65011e2eb/c8280906575e4404bca664bb033db452/FLAGd7070a176 [2019-01-01 17:59:15,295 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:59:15,296 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2019-01-01 17:59:15,316 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65011e2eb/c8280906575e4404bca664bb033db452/FLAGd7070a176 [2019-01-01 17:59:15,529 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65011e2eb/c8280906575e4404bca664bb033db452 [2019-01-01 17:59:15,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:59:15,534 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:59:15,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:59:15,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:59:15,539 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:59:15,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:59:15" (1/1) ... [2019-01-01 17:59:15,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ea0a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:15, skipping insertion in model container [2019-01-01 17:59:15,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:59:15" (1/1) ... [2019-01-01 17:59:15,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:59:15,597 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:59:15,984 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:59:16,000 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:59:16,152 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:59:16,215 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:59:16,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:16 WrapperNode [2019-01-01 17:59:16,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:59:16,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:59:16,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:59:16,218 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:59:16,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:16" (1/1) ... [2019-01-01 17:59:16,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:16" (1/1) ... [2019-01-01 17:59:16,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:16" (1/1) ... [2019-01-01 17:59:16,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:16" (1/1) ... [2019-01-01 17:59:16,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:16" (1/1) ... [2019-01-01 17:59:16,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:16" (1/1) ... [2019-01-01 17:59:16,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:16" (1/1) ... [2019-01-01 17:59:16,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:59:16,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:59:16,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:59:16,311 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:59:16,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:59:16,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:59:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:59:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-01-01 17:59:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-01-01 17:59:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:59:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 17:59:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:59:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:59:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:59:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:59:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:59:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:59:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:59:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:59:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:59:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:59:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:59:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:59:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:59:16,377 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:59:16,377 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:59:16,377 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:59:16,377 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:59:16,377 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:59:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:59:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:59:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:59:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:59:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:59:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:59:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:59:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:59:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:59:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:59:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:59:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:59:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:59:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:59:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:59:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:59:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:59:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:59:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:59:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:59:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:59:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:59:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:59:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:59:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:59:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:59:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:59:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:59:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:59:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:59:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:59:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:59:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:59:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:59:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:59:16,384 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:59:16,385 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:59:16,385 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:59:16,385 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:59:16,385 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:59:16,385 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:59:16,385 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:59:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:59:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:59:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:59:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:59:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-01 17:59:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:59:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:59:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:59:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:59:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:59:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:59:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:59:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:59:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:59:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:59:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:59:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:59:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:59:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:59:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:59:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:59:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:59:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:59:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:59:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:59:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:59:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:59:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:59:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:59:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:59:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:59:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:59:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:59:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:59:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:59:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:59:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:59:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:59:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:59:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:59:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:59:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-01-01 17:59:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 17:59:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 17:59:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 17:59:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-01 17:59:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-01-01 17:59:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-01 17:59:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:59:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:59:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:59:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:59:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:59:17,331 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:59:17,332 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-01 17:59:17,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:59:17 BoogieIcfgContainer [2019-01-01 17:59:17,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:59:17,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:59:17,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:59:17,340 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:59:17,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:59:15" (1/3) ... [2019-01-01 17:59:17,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183152d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:59:17, skipping insertion in model container [2019-01-01 17:59:17,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:16" (2/3) ... [2019-01-01 17:59:17,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183152d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:59:17, skipping insertion in model container [2019-01-01 17:59:17,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:59:17" (3/3) ... [2019-01-01 17:59:17,346 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2019-01-01 17:59:17,358 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:59:17,370 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-01-01 17:59:17,393 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-01-01 17:59:17,428 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:59:17,432 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:59:17,434 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:59:17,435 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:59:17,435 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:59:17,435 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:59:17,436 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:59:17,436 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:59:17,436 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:59:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-01-01 17:59:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:59:17,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:17,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:17,483 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2019-01-01 17:59:17,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:17,495 INFO L82 PathProgramCache]: Analyzing trace with hash -515788903, now seen corresponding path program 1 times [2019-01-01 17:59:17,501 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:17,502 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:17,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:17,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:17,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:59:17,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:17,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:17,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 17:59:17,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 17:59:17,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:17,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:17,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-01-01 17:59:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:17,891 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:17,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:17,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:59:17,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:59:17,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:59:17,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:59:17,923 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 5 states. [2019-01-01 17:59:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:18,848 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-01 17:59:18,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:59:18,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-01 17:59:18,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:18,863 INFO L225 Difference]: With dead ends: 70 [2019-01-01 17:59:18,863 INFO L226 Difference]: Without dead ends: 67 [2019-01-01 17:59:18,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:59:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-01 17:59:18,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-01 17:59:18,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-01 17:59:18,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-01 17:59:18,927 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 9 [2019-01-01 17:59:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:18,928 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-01 17:59:18,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:59:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-01 17:59:18,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:59:18,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:18,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:18,929 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2019-01-01 17:59:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:18,930 INFO L82 PathProgramCache]: Analyzing trace with hash -515788902, now seen corresponding path program 1 times [2019-01-01 17:59:18,930 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:18,930 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:18,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:19,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:19,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:59:19,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:19,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:59:19,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:19,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:19,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-01 17:59:19,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:19,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:19,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-01 17:59:19,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:19,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:19,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:19,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 17:59:19,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:19,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:19,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2019-01-01 17:59:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:19,569 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:19,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:19,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:59:19,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:59:19,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:59:19,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:59:19,573 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 5 states. [2019-01-01 17:59:20,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:20,097 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-01 17:59:20,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:59:20,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-01 17:59:20,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:20,100 INFO L225 Difference]: With dead ends: 66 [2019-01-01 17:59:20,100 INFO L226 Difference]: Without dead ends: 66 [2019-01-01 17:59:20,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:59:20,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-01 17:59:20,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-01 17:59:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-01 17:59:20,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-01 17:59:20,110 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 9 [2019-01-01 17:59:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:20,111 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-01 17:59:20,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:59:20,111 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-01 17:59:20,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 17:59:20,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:20,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:20,112 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2019-01-01 17:59:20,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:20,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1751897317, now seen corresponding path program 1 times [2019-01-01 17:59:20,113 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:20,113 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:20,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:20,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:20,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:59:20,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:20,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:59:20,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:20,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:20,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-01 17:59:20,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:20,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:20,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-01 17:59:20,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:20,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:20,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-01 17:59:20,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:20,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:20,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-01-01 17:59:20,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:20,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:20,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-01 17:59:20,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:20,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:20,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:20,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2019-01-01 17:59:20,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:20,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:20,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2019-01-01 17:59:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:20,577 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:20,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:20,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:59:20,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:59:20,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:59:20,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:59:20,581 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 6 states. [2019-01-01 17:59:21,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:21,027 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-01 17:59:21,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:59:21,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-01 17:59:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:21,030 INFO L225 Difference]: With dead ends: 63 [2019-01-01 17:59:21,030 INFO L226 Difference]: Without dead ends: 63 [2019-01-01 17:59:21,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:59:21,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-01 17:59:21,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-01 17:59:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-01 17:59:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-01 17:59:21,038 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 11 [2019-01-01 17:59:21,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:21,038 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-01 17:59:21,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:59:21,038 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-01 17:59:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 17:59:21,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:21,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:21,039 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2019-01-01 17:59:21,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:21,040 INFO L82 PathProgramCache]: Analyzing trace with hash 53856989, now seen corresponding path program 1 times [2019-01-01 17:59:21,040 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:21,040 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:21,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:21,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:21,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:59:21,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:21,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:21,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 17:59:21,284 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 [2019-01-01 17:59:21,288 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 [2019-01-01 17:59:21,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:21,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:21,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:21,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:20 [2019-01-01 17:59:21,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:21,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:21,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:21,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 46 [2019-01-01 17:59:21,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:21,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:21,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:38 [2019-01-01 17:59:21,460 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 32 treesize of output 25 [2019-01-01 17:59:21,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:21,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2019-01-01 17:59:21,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:21,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:21,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:21,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:56 [2019-01-01 17:59:21,587 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 47 treesize of output 35 [2019-01-01 17:59:21,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2019-01-01 17:59:21,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:21,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:21,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:21,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:27 [2019-01-01 17:59:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:21,794 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:21,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:21,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 17:59:21,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 17:59:21,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 17:59:21,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:59:21,803 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 9 states. [2019-01-01 17:59:22,226 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-01-01 17:59:22,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:22,661 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-01 17:59:22,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 17:59:22,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-01-01 17:59:22,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:22,664 INFO L225 Difference]: With dead ends: 62 [2019-01-01 17:59:22,664 INFO L226 Difference]: Without dead ends: 62 [2019-01-01 17:59:22,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:59:22,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-01 17:59:22,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-01 17:59:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-01 17:59:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-01 17:59:22,671 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 13 [2019-01-01 17:59:22,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:22,672 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-01 17:59:22,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 17:59:22,672 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-01 17:59:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 17:59:22,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:22,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:22,673 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2019-01-01 17:59:22,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:22,674 INFO L82 PathProgramCache]: Analyzing trace with hash 53856990, now seen corresponding path program 1 times [2019-01-01 17:59:22,674 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:22,674 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:22,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:22,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:22,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:59:22,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:22,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:59:22,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:22,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:22,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-01-01 17:59:22,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 17:59:22,912 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 [2019-01-01 17:59:22,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:22,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:22,971 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 [2019-01-01 17:59:22,975 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 [2019-01-01 17:59:22,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:22,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:23,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:23,004 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2019-01-01 17:59:23,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:23,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:23,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2019-01-01 17:59:23,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:23,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-01 17:59:23,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:23,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:23,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:33 [2019-01-01 17:59:23,140 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 21 treesize of output 16 [2019-01-01 17:59:23,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:23,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-01 17:59:23,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:23,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:23,264 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 31 treesize of output 24 [2019-01-01 17:59:23,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:23,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2019-01-01 17:59:23,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:23,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:23,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:23,326 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2019-01-01 17:59:23,471 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 [2019-01-01 17:59:23,490 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 [2019-01-01 17:59:23,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:23,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:23,563 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 38 treesize of output 28 [2019-01-01 17:59:23,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2019-01-01 17:59:23,584 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:23,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:23,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:23,607 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:18 [2019-01-01 17:59:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:23,819 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:23,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:23,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 17:59:23,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 17:59:23,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 17:59:23,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:59:23,823 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 9 states. [2019-01-01 17:59:24,362 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-01-01 17:59:24,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:24,778 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-01 17:59:24,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 17:59:24,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-01-01 17:59:24,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:24,780 INFO L225 Difference]: With dead ends: 61 [2019-01-01 17:59:24,781 INFO L226 Difference]: Without dead ends: 61 [2019-01-01 17:59:24,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:59:24,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-01 17:59:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-01 17:59:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-01 17:59:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-01 17:59:24,789 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 13 [2019-01-01 17:59:24,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:24,789 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-01 17:59:24,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 17:59:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-01 17:59:24,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:59:24,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:24,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:24,791 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2019-01-01 17:59:24,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:24,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1864217314, now seen corresponding path program 1 times [2019-01-01 17:59:24,792 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:24,792 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:24,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:24,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:24,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:59:24,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:24,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:24,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 17:59:24,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:24,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:24,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 17:59:24,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:24,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:24,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-01 17:59:25,025 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 [2019-01-01 17:59:25,029 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 [2019-01-01 17:59:25,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:25,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:25,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:25,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-01-01 17:59:25,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-01 17:59:25,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:25,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:25,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:22 [2019-01-01 17:59:25,168 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 22 treesize of output 17 [2019-01-01 17:59:25,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:25,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-01 17:59:25,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:25,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:25,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:25,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-01-01 17:59:25,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2019-01-01 17:59:25,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-01 17:59:25,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:25,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:25,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:25,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:30 [2019-01-01 17:59:25,372 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 [2019-01-01 17:59:25,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2019-01-01 17:59:25,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:25,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:25,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:25,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:13 [2019-01-01 17:59:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:25,413 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:25,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:25,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 17:59:25,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 17:59:25,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 17:59:25,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:59:25,416 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 10 states. [2019-01-01 17:59:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:26,397 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-01 17:59:26,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 17:59:26,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-01-01 17:59:26,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:26,399 INFO L225 Difference]: With dead ends: 60 [2019-01-01 17:59:26,399 INFO L226 Difference]: Without dead ends: 60 [2019-01-01 17:59:26,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-01-01 17:59:26,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-01 17:59:26,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-01 17:59:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-01 17:59:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-01 17:59:26,406 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 16 [2019-01-01 17:59:26,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:26,406 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-01 17:59:26,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 17:59:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-01 17:59:26,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:59:26,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:26,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:26,408 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2019-01-01 17:59:26,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:26,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1864217313, now seen corresponding path program 1 times [2019-01-01 17:59:26,408 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:26,409 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:26,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:26,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:26,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:59:26,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:26,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:26,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 17:59:26,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:26,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:26,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 17:59:26,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:26,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:26,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-01 17:59:26,720 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 [2019-01-01 17:59:26,726 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 [2019-01-01 17:59:26,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:26,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:26,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:26,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2019-01-01 17:59:26,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:59:26,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:26,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:26,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-01-01 17:59:26,813 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 22 treesize of output 17 [2019-01-01 17:59:26,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:26,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-01 17:59:26,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:26,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:26,886 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 13 treesize of output 10 [2019-01-01 17:59:26,890 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 10 treesize of output 9 [2019-01-01 17:59:26,891 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:26,894 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:26,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:26,915 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:32 [2019-01-01 17:59:27,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2019-01-01 17:59:27,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-01 17:59:27,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:27,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:27,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2019-01-01 17:59:27,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-01 17:59:27,136 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:27,143 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:27,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:27,159 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:32 [2019-01-01 17:59:27,164 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 [2019-01-01 17:59:27,167 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 [2019-01-01 17:59:27,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:27,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:27,231 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 [2019-01-01 17:59:27,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2019-01-01 17:59:27,236 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:27,247 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:27,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:27,252 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:9 [2019-01-01 17:59:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:27,273 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:27,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:27,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 17:59:27,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 17:59:27,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 17:59:27,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:59:27,277 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 10 states. [2019-01-01 17:59:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:27,960 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-01 17:59:27,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 17:59:27,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-01-01 17:59:27,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:27,964 INFO L225 Difference]: With dead ends: 59 [2019-01-01 17:59:27,964 INFO L226 Difference]: Without dead ends: 59 [2019-01-01 17:59:27,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-01-01 17:59:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-01 17:59:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-01 17:59:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-01 17:59:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-01 17:59:27,970 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 16 [2019-01-01 17:59:27,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:27,970 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-01 17:59:27,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 17:59:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-01 17:59:27,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:59:27,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:27,972 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] [2019-01-01 17:59:27,972 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2019-01-01 17:59:27,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:27,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1351600001, now seen corresponding path program 1 times [2019-01-01 17:59:27,973 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:27,973 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:27,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:28,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:28,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 17:59:28,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:28,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:28,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-01-01 17:59:28,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:28,143 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (9)] Exception during sending of exit command (exit): Broken pipe [2019-01-01 17:59:28,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:28,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:59:28,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:59:28,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:59:28,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:59:28,147 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 7 states. [2019-01-01 17:59:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:28,579 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-01 17:59:28,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:59:28,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-01-01 17:59:28,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:28,582 INFO L225 Difference]: With dead ends: 63 [2019-01-01 17:59:28,582 INFO L226 Difference]: Without dead ends: 63 [2019-01-01 17:59:28,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:59:28,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-01 17:59:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-01-01 17:59:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-01 17:59:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-01 17:59:28,589 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 22 [2019-01-01 17:59:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:28,589 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-01 17:59:28,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:59:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-01 17:59:28,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:59:28,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:28,591 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] [2019-01-01 17:59:28,592 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2019-01-01 17:59:28,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:28,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1351600002, now seen corresponding path program 1 times [2019-01-01 17:59:28,592 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:28,592 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:28,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:28,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:28,817 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:28,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:28,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:59:28,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:59:28,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:59:28,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:59:28,824 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 8 states. [2019-01-01 17:59:29,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:29,281 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-01 17:59:29,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:59:29,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-01-01 17:59:29,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:29,283 INFO L225 Difference]: With dead ends: 53 [2019-01-01 17:59:29,284 INFO L226 Difference]: Without dead ends: 53 [2019-01-01 17:59:29,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:59:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-01 17:59:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-01 17:59:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-01 17:59:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-01 17:59:29,291 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 22 [2019-01-01 17:59:29,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:29,292 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-01 17:59:29,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:59:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-01 17:59:29,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 17:59:29,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:29,296 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] [2019-01-01 17:59:29,297 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2019-01-01 17:59:29,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:29,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1819311235, now seen corresponding path program 1 times [2019-01-01 17:59:29,299 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:29,299 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:29,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:29,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:29,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:59:29,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 17:59:29,548 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 [2019-01-01 17:59:29,552 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 [2019-01-01 17:59:29,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-01-01 17:59:29,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:29,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:29,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-01 17:59:29,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2019-01-01 17:59:29,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-01-01 17:59:29,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:29,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2019-01-01 17:59:29,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2019-01-01 17:59:29,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 62 [2019-01-01 17:59:29,913 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 62 treesize of output 42 [2019-01-01 17:59:29,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:30,103 INFO L303 Elim1Store]: Index analysis took 108 ms [2019-01-01 17:59:30,313 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 57 [2019-01-01 17:59:30,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-01 17:59:30,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 17:59:30,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 17:59:30,473 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:89 [2019-01-01 17:59:30,808 INFO L303 Elim1Store]: Index analysis took 104 ms [2019-01-01 17:59:30,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-01-01 17:59:30,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 17:59:30,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:30,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:31,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2019-01-01 17:59:31,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 17:59:31,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:31,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:31,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 56 [2019-01-01 17:59:31,352 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 52 treesize of output 28 [2019-01-01 17:59:31,353 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:31,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:31,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 43 [2019-01-01 17:59:31,474 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2019-01-01 17:59:31,533 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:59:31,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-01 17:59:31,632 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:168, output treesize:80 [2019-01-01 17:59:31,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:31,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:31,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2019-01-01 17:59:31,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:31,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:31,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2019-01-01 17:59:32,051 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 25 [2019-01-01 17:59:32,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2019-01-01 17:59:32,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:32,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:32,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:32,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:5 [2019-01-01 17:59:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:32,145 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (11)] Exception during sending of exit command (exit): Broken pipe [2019-01-01 17:59:32,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:32,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-01 17:59:32,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 17:59:32,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 17:59:32,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-01-01 17:59:32,149 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 17 states. [2019-01-01 17:59:33,047 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-01 17:59:35,385 WARN L181 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-01-01 17:59:37,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:37,001 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-01 17:59:37,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 17:59:37,003 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-01-01 17:59:37,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:37,007 INFO L225 Difference]: With dead ends: 54 [2019-01-01 17:59:37,007 INFO L226 Difference]: Without dead ends: 54 [2019-01-01 17:59:37,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2019-01-01 17:59:37,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-01 17:59:37,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-01-01 17:59:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-01 17:59:37,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-01 17:59:37,013 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26 [2019-01-01 17:59:37,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:37,013 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-01 17:59:37,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 17:59:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-01 17:59:37,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 17:59:37,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:37,019 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] [2019-01-01 17:59:37,020 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2019-01-01 17:59:37,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:37,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1819311236, now seen corresponding path program 1 times [2019-01-01 17:59:37,020 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:37,021 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:37,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:37,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:37,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:59:37,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 17:59:37,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:59:37,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2019-01-01 17:59:37,354 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 [2019-01-01 17:59:37,357 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 [2019-01-01 17:59:37,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:40 [2019-01-01 17:59:37,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:37,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-01 17:59:37,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:54 [2019-01-01 17:59:37,540 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 13 treesize of output 10 [2019-01-01 17:59:37,544 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 10 treesize of output 9 [2019-01-01 17:59:37,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2019-01-01 17:59:37,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:37,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:37,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 66 [2019-01-01 17:59:37,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,665 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,711 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:80, output treesize:66 [2019-01-01 17:59:37,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 108 [2019-01-01 17:59:37,980 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 107 treesize of output 79 [2019-01-01 17:59:37,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:38,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 91 [2019-01-01 17:59:38,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 17:59:38,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:59:38,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 94 [2019-01-01 17:59:38,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:38,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:38,659 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 83 treesize of output 72 [2019-01-01 17:59:38,660 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:38,702 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:38,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 130 [2019-01-01 17:59:38,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:38,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:38,868 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 4 case distinctions, treesize of input 111 treesize of output 110 [2019-01-01 17:59:38,872 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-01 17:59:39,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 95 [2019-01-01 17:59:39,289 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:39,507 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-01 17:59:39,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-01 17:59:39,714 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:173, output treesize:236 [2019-01-01 17:59:40,071 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-01 17:59:40,442 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-01 17:59:40,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 147 [2019-01-01 17:59:40,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 111 [2019-01-01 17:59:40,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:59:41,080 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 128 treesize of output 104 [2019-01-01 17:59:41,081 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:41,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:59:44,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:44,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 167 [2019-01-01 17:59:44,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 17:59:44,783 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:44,901 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:46,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:46,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 121 [2019-01-01 17:59:46,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 17:59:46,875 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:46,925 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:47,944 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 84 treesize of output 75 [2019-01-01 17:59:47,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 17:59:47,950 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:47,977 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:48,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:48,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 131 [2019-01-01 17:59:48,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 17:59:48,546 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:48,594 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:49,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 109 [2019-01-01 17:59:49,069 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 105 treesize of output 81 [2019-01-01 17:59:49,069 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:49,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:49,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 96 [2019-01-01 17:59:49,460 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2019-01-01 17:59:49,662 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:59:49,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 74 [2019-01-01 17:59:49,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:49,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 29 treesize of output 36 [2019-01-01 17:59:49,695 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:49,993 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:50,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-01 17:59:50,443 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 10 variables, input treesize:418, output treesize:272 [2019-01-01 17:59:51,856 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-01-01 17:59:52,082 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 38 [2019-01-01 17:59:52,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:52,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:52,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:52,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 33 [2019-01-01 17:59:52,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:52,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:52,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:312, output treesize:95 [2019-01-01 17:59:52,781 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 43 treesize of output 33 [2019-01-01 17:59:52,795 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 33 treesize of output 20 [2019-01-01 17:59:52,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:52,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:52,906 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 65 treesize of output 49 [2019-01-01 17:59:52,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2019-01-01 17:59:52,914 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:52,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:52,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:52,981 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:30 [2019-01-01 17:59:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:53,405 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:53,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:53,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-01 17:59:53,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 17:59:53,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 17:59:53,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-01-01 17:59:53,409 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 17 states. [2019-01-01 17:59:54,676 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-01 18:00:20,623 WARN L181 SmtUtils]: Spent 24.68 s on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-01-01 18:00:24,030 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 18:00:24,849 WARN L181 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-01-01 18:00:25,612 WARN L181 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-01-01 18:00:27,526 WARN L181 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-01-01 18:00:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:00:28,157 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-01 18:00:28,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 18:00:28,159 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-01-01 18:00:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:00:28,160 INFO L225 Difference]: With dead ends: 52 [2019-01-01 18:00:28,160 INFO L226 Difference]: Without dead ends: 52 [2019-01-01 18:00:28,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2019-01-01 18:00:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-01 18:00:28,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-01-01 18:00:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-01 18:00:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-01 18:00:28,164 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 26 [2019-01-01 18:00:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:00:28,164 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-01 18:00:28,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 18:00:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-01 18:00:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 18:00:28,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:00:28,168 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] [2019-01-01 18:00:28,169 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2019-01-01 18:00:28,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:00:28,169 INFO L82 PathProgramCache]: Analyzing trace with hash 564073450, now seen corresponding path program 1 times [2019-01-01 18:00:28,169 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 18:00:28,172 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 18:00:28,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:00:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:00:28,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:00:28,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 18:00:28,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:28,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:28,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 18:00:28,423 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 [2019-01-01 18:00:28,429 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 [2019-01-01 18:00:28,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:28,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:28,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:28,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-01-01 18:00:28,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:28,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:28,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-01 18:00:28,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:28,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:28,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2019-01-01 18:00:28,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-01-01 18:00:28,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:28,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2019-01-01 18:00:28,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:28,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:28,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:28,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2019-01-01 18:00:28,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 55 [2019-01-01 18:00:28,831 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 51 treesize of output 31 [2019-01-01 18:00:28,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:28,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:28,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:29,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 56 [2019-01-01 18:00:29,030 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-01 18:00:29,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 18:00:29,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 18:00:29,167 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:68 [2019-01-01 18:00:29,417 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 18:00:29,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2019-01-01 18:00:29,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 18:00:29,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:29,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:29,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2019-01-01 18:00:29,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 18:00:29,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:29,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:29,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 62 [2019-01-01 18:00:29,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2019-01-01 18:00:29,800 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:29,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:29,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 45 [2019-01-01 18:00:29,917 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2019-01-01 18:00:29,993 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 18:00:30,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-01-01 18:00:30,079 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:188, output treesize:129 [2019-01-01 18:00:30,281 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-01 18:00:30,287 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 18:00:30,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:30,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:30,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:30,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2019-01-01 18:00:30,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:30,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:30,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:33 [2019-01-01 18:00:30,553 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 35 treesize of output 27 [2019-01-01 18:00:30,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2019-01-01 18:00:30,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:30,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:30,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:30,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:7 [2019-01-01 18:00:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:00:30,678 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 18:00:30,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:00:30,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-01 18:00:30,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 18:00:30,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 18:00:30,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-01-01 18:00:30,681 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 17 states. [2019-01-01 18:00:31,679 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-01-01 18:00:32,379 WARN L181 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2019-01-01 18:00:33,326 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 18:00:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:00:33,886 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-01 18:00:33,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 18:00:33,888 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-01-01 18:00:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:00:33,890 INFO L225 Difference]: With dead ends: 51 [2019-01-01 18:00:33,891 INFO L226 Difference]: Without dead ends: 51 [2019-01-01 18:00:33,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2019-01-01 18:00:33,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-01 18:00:33,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-01-01 18:00:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-01 18:00:33,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-01 18:00:33,896 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 27 [2019-01-01 18:00:33,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:00:33,896 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-01 18:00:33,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 18:00:33,896 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-01 18:00:33,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 18:00:33,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:00:33,900 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] [2019-01-01 18:00:33,901 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2019-01-01 18:00:33,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:00:33,901 INFO L82 PathProgramCache]: Analyzing trace with hash 564073451, now seen corresponding path program 1 times [2019-01-01 18:00:33,901 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 18:00:33,901 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 18:00:33,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:00:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:00:34,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:00:34,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 18:00:34,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:34,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:34,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 18:00:34,241 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 [2019-01-01 18:00:34,253 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 [2019-01-01 18:00:34,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:34,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:34,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:34,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-01-01 18:00:34,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:34,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:34,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-01 18:00:34,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:34,375 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 6 treesize of output 5 [2019-01-01 18:00:34,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:34,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:34,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:28 [2019-01-01 18:00:34,471 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 13 treesize of output 10 [2019-01-01 18:00:34,477 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 10 treesize of output 9 [2019-01-01 18:00:34,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:34,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:34,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-01-01 18:00:34,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:34,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2019-01-01 18:00:34,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:34,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:34,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:34,597 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:46 [2019-01-01 18:00:34,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2019-01-01 18:00:34,808 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 38 treesize of output 18 [2019-01-01 18:00:34,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:34,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 27 [2019-01-01 18:00:34,899 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 18:00:34,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 18:00:35,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 52 [2019-01-01 18:00:35,038 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 44 treesize of output 50 [2019-01-01 18:00:35,039 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 18:00:35,069 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 18:00:35,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 73 [2019-01-01 18:00:35,161 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 71 treesize of output 51 [2019-01-01 18:00:35,161 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:35,333 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 4 case distinctions, treesize of input 53 treesize of output 56 [2019-01-01 18:00:35,336 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-01 18:00:35,440 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-01 18:00:35,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-01 18:00:35,581 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:100, output treesize:158 [2019-01-01 18:00:35,835 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-01-01 18:00:36,099 INFO L303 Elim1Store]: Index analysis took 106 ms [2019-01-01 18:00:36,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 93 [2019-01-01 18:00:36,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 18:00:36,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:36,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:37,601 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 92 treesize of output 83 [2019-01-01 18:00:37,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 18:00:37,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:37,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:38,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 62 [2019-01-01 18:00:38,380 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 60 treesize of output 36 [2019-01-01 18:00:38,380 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:38,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:38,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 57 [2019-01-01 18:00:38,559 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2019-01-01 18:00:38,622 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 18:00:39,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2019-01-01 18:00:39,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 18:00:39,068 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:39,083 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:39,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 100 [2019-01-01 18:00:39,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 18:00:39,328 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:39,361 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:39,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 64 [2019-01-01 18:00:39,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 18:00:39,562 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:39,584 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:39,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-01 18:00:39,705 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 10 variables, input treesize:301, output treesize:127 [2019-01-01 18:00:39,969 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 18:00:39,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:40,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:40,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:40,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2019-01-01 18:00:40,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:40,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:40,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:167, output treesize:42 [2019-01-01 18:00:40,311 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 [2019-01-01 18:00:40,316 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 [2019-01-01 18:00:40,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:40,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:40,337 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 25 [2019-01-01 18:00:40,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2019-01-01 18:00:40,343 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:40,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:40,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:40,359 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:9 [2019-01-01 18:00:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:00:40,470 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 18:00:40,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:00:40,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-01 18:00:40,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 18:00:40,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 18:00:40,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-01-01 18:00:40,475 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 17 states. [2019-01-01 18:00:42,421 WARN L181 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-01-01 18:00:43,059 WARN L181 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-01-01 18:00:47,369 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-01 18:00:48,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:00:48,795 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-01 18:00:48,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 18:00:48,797 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-01-01 18:00:48,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:00:48,798 INFO L225 Difference]: With dead ends: 49 [2019-01-01 18:00:48,798 INFO L226 Difference]: Without dead ends: 49 [2019-01-01 18:00:48,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=127, Invalid=741, Unknown=2, NotChecked=0, Total=870 [2019-01-01 18:00:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-01 18:00:48,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-01-01 18:00:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 18:00:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-01 18:00:48,802 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 27 [2019-01-01 18:00:48,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:00:48,802 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-01 18:00:48,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 18:00:48,802 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-01 18:00:48,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 18:00:48,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:00:48,803 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] [2019-01-01 18:00:48,804 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2019-01-01 18:00:48,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:00:48,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1894862360, now seen corresponding path program 1 times [2019-01-01 18:00:48,804 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 18:00:48,805 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 18:00:48,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:00:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:00:49,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:00:49,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 18:00:49,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:49,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:49,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 18:00:49,105 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 [2019-01-01 18:00:49,109 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 [2019-01-01 18:00:49,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:49,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:49,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:49,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2019-01-01 18:00:49,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:49,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:49,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-01 18:00:49,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:49,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:49,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:27 [2019-01-01 18:00:49,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-01-01 18:00:49,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:49,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2019-01-01 18:00:49,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:49,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:49,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:49,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2019-01-01 18:00:49,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 57 [2019-01-01 18:00:49,504 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 55 treesize of output 35 [2019-01-01 18:00:49,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:49,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:49,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:49,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 49 [2019-01-01 18:00:49,667 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-01 18:00:49,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 18:00:49,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 18:00:49,843 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:60, output treesize:81 [2019-01-01 18:00:50,518 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-01 18:00:50,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-01-01 18:00:50,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 18:00:50,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:50,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:50,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 54 [2019-01-01 18:00:50,832 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 50 treesize of output 26 [2019-01-01 18:00:50,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:51,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:51,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 41 [2019-01-01 18:00:51,067 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2019-01-01 18:00:51,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 18:00:51,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2019-01-01 18:00:51,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 18:00:51,302 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:51,318 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:51,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-01 18:00:51,388 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:162, output treesize:72 [2019-01-01 18:00:51,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:51,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:51,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2019-01-01 18:00:51,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:51,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:51,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2019-01-01 18:00:51,813 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 31 treesize of output 23 [2019-01-01 18:00:51,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2019-01-01 18:00:51,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:51,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:51,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:51,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:3 [2019-01-01 18:00:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:00:52,266 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 18:00:52,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:00:52,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-01 18:00:52,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 18:00:52,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 18:00:52,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-01-01 18:00:52,272 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 17 states. [2019-01-01 18:00:53,120 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-01-01 18:00:53,312 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-01-01 18:00:53,669 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-01-01 18:00:56,818 WARN L181 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-01-01 18:00:58,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:00:58,387 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-01 18:00:58,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 18:00:58,389 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-01 18:00:58,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:00:58,390 INFO L225 Difference]: With dead ends: 48 [2019-01-01 18:00:58,390 INFO L226 Difference]: Without dead ends: 48 [2019-01-01 18:00:58,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2019-01-01 18:00:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-01 18:00:58,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-01-01 18:00:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-01 18:00:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-01 18:00:58,398 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 30 [2019-01-01 18:00:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:00:58,398 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-01 18:00:58,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 18:00:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-01 18:00:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-01 18:00:58,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:00:58,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:00:58,407 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2019-01-01 18:00:58,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:00:58,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1089311954, now seen corresponding path program 1 times [2019-01-01 18:00:58,408 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 18:00:58,408 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 18:00:58,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:00:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:00:58,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:00:58,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 18:00:58,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:58,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:58,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 18:00:58,758 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 [2019-01-01 18:00:58,761 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 [2019-01-01 18:00:58,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:58,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:58,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:58,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-01-01 18:00:58,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:58,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:58,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-01 18:00:58,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:58,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:58,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:23 [2019-01-01 18:00:58,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-01-01 18:00:58,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:58,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2019-01-01 18:00:58,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:58,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:58,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:58,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2019-01-01 18:00:59,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 59 [2019-01-01 18:00:59,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:59,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:59,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 49 [2019-01-01 18:00:59,176 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-01 18:00:59,369 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 49 treesize of output 29 [2019-01-01 18:00:59,369 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:59,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-01 18:00:59,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-01 18:00:59,523 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:93 [2019-01-01 18:00:59,680 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-01 18:00:59,878 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 18:00:59,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2019-01-01 18:00:59,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 18:00:59,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:59,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:01:00,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 58 [2019-01-01 18:01:00,201 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 54 treesize of output 30 [2019-01-01 18:01:00,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 18:01:00,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:01:00,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 55 [2019-01-01 18:01:00,368 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2019-01-01 18:01:00,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 18:01:00,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2019-01-01 18:01:00,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 18:01:00,595 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 18:01:00,610 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:01:00,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-01 18:01:00,692 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:174, output treesize:97 [2019-01-01 18:01:02,912 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-01 18:01:02,954 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 18:01:02,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:01:03,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:01:03,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:01:03,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2019-01-01 18:01:03,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:01:03,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:01:03,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:137, output treesize:31 [2019-01-01 18:01:03,391 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 31 treesize of output 23 [2019-01-01 18:01:03,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2019-01-01 18:01:03,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:01:03,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:01:03,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:01:03,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:3 [2019-01-01 18:01:03,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:01:03,506 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (16)] Exception during sending of exit command (exit): Broken pipe [2019-01-01 18:01:03,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:01:03,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-01 18:01:03,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 18:01:03,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 18:01:03,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=234, Unknown=1, NotChecked=0, Total=272 [2019-01-01 18:01:03,513 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 17 states. [2019-01-01 18:01:04,419 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-01-01 18:01:28,401 WARN L181 SmtUtils]: Spent 23.69 s on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-01-01 18:01:37,809 WARN L181 SmtUtils]: Spent 9.27 s on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-01-01 18:01:38,485 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-01 18:01:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:01:39,951 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-01 18:01:39,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 18:01:39,954 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2019-01-01 18:01:39,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:01:39,955 INFO L225 Difference]: With dead ends: 47 [2019-01-01 18:01:39,955 INFO L226 Difference]: Without dead ends: 47 [2019-01-01 18:01:39,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=128, Invalid=741, Unknown=1, NotChecked=0, Total=870 [2019-01-01 18:01:39,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-01 18:01:39,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-01-01 18:01:39,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-01 18:01:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-01 18:01:39,960 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 33 [2019-01-01 18:01:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:01:39,964 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-01 18:01:39,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 18:01:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-01 18:01:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 18:01:39,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:01:39,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:01:39,968 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2019-01-01 18:01:39,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:01:39,968 INFO L82 PathProgramCache]: Analyzing trace with hash 591067884, now seen corresponding path program 1 times [2019-01-01 18:01:39,968 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 18:01:39,969 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 18:01:39,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:01:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:01:40,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:01:40,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 18:01:40,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:01:40,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:01:40,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 18:01:40,321 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 [2019-01-01 18:01:40,324 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 [2019-01-01 18:01:40,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:01:40,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:01:40,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:01:40,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2019-01-01 18:01:40,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2019-01-01 18:01:40,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:01:40,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:01:40,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 57 [2019-01-01 18:01:40,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:01:40,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:01:40,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:01:40,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:46 [2019-01-01 18:01:40,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 70 [2019-01-01 18:01:40,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:01:40,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:01:40,746 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 4 case distinctions, treesize of input 53 treesize of output 60 [2019-01-01 18:01:40,747 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-01 18:01:40,950 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 60 treesize of output 40 [2019-01-01 18:01:40,951 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 18:01:41,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-01 18:01:41,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-01 18:01:41,099 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:100 [2019-01-01 18:01:41,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:01:41,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 57 [2019-01-01 18:01:41,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 18:01:41,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:01:41,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:01:41,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 59 [2019-01-01 18:01:41,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:01:41,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 56 [2019-01-01 18:01:41,775 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2019-01-01 18:01:41,938 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 45 treesize of output 21 [2019-01-01 18:01:41,938 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 18:01:41,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 18:01:42,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:01:42,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 77 [2019-01-01 18:01:42,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-01 18:01:42,113 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 18:01:42,126 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:01:42,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-01 18:01:42,194 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:181, output treesize:105 [2019-01-01 18:01:44,393 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-01 18:01:44,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:01:44,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:01:44,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:01:44,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 33 [2019-01-01 18:01:44,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:01:44,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:01:44,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:125, output treesize:36 [2019-01-01 18:01:44,810 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 43 treesize of output 31 [2019-01-01 18:01:44,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-01-01 18:01:44,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:01:44,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:01:44,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:01:44,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:4 [2019-01-01 18:01:44,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:01:44,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-01 18:01:44,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:01:45,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 18:01:45,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-01-01 18:01:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:01:45,064 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 18:01:45,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:01:45,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-01 18:01:45,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-01 18:01:45,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 18:01:45,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=371, Unknown=1, NotChecked=0, Total=420 [2019-01-01 18:01:45,068 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 21 states. [2019-01-01 18:01:48,899 WARN L181 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2019-01-01 18:01:53,741 WARN L181 SmtUtils]: Spent 4.75 s on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-01-01 18:01:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:01:56,141 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-01 18:01:56,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-01 18:01:56,144 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-01-01 18:01:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:01:56,144 INFO L225 Difference]: With dead ends: 46 [2019-01-01 18:01:56,144 INFO L226 Difference]: Without dead ends: 46 [2019-01-01 18:01:56,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=161, Invalid=1098, Unknown=1, NotChecked=0, Total=1260 [2019-01-01 18:01:56,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-01 18:01:56,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-01-01 18:01:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 18:01:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-01 18:01:56,149 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 34 [2019-01-01 18:01:56,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:01:56,150 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-01 18:01:56,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-01 18:01:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-01 18:01:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 18:01:56,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:01:56,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:01:56,152 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr16REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2019-01-01 18:01:56,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:01:56,152 INFO L82 PathProgramCache]: Analyzing trace with hash 546373601, now seen corresponding path program 1 times [2019-01-01 18:01:56,152 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 18:01:56,152 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 18:01:56,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:01:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 18:01:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 18:01:56,818 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 18:01:56,840 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-01 18:01:56,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 06:01:56 BoogieIcfgContainer [2019-01-01 18:01:56,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 18:01:56,862 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 18:01:56,863 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 18:01:56,863 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 18:01:56,864 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:59:17" (3/4) ... [2019-01-01 18:01:56,875 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 18:01:56,875 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 18:01:56,876 INFO L168 Benchmark]: Toolchain (without parser) took 161343.64 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.2 MB). Free memory was 947.3 MB in the beginning and 1.3 GB in the end (delta: -334.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 18:01:56,879 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 18:01:56,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 681.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-01-01 18:01:56,880 INFO L168 Benchmark]: Boogie Preprocessor took 92.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 18:01:56,883 INFO L168 Benchmark]: RCFGBuilder took 1023.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2019-01-01 18:01:56,884 INFO L168 Benchmark]: TraceAbstraction took 159526.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -217.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 18:01:56,884 INFO L168 Benchmark]: Witness Printer took 12.93 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 18:01:56,889 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 681.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.64 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 1023.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 159526.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -217.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 12.93 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] TData data; VAL [data={-2146959343:0}] [L643] CALL alloc_data(&data) VAL [pdata={-2146959343:0}] [L625] pdata->lo = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={2:0}, pdata={-2146959343:0}, pdata={-2146959343:0}] [L626] pdata->hi = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={1:0}, malloc(sizeof(int))={2:0}, pdata={-2146959343:0}, pdata={-2146959343:0}] [L627] EXPR pdata->lo VAL [malloc(sizeof(int))={1:0}, malloc(sizeof(int))={2:0}, pdata={-2146959343:0}, pdata={-2146959343:0}, pdata->lo={2:0}] [L627] *(pdata->lo) = 4 VAL [malloc(sizeof(int))={1:0}, malloc(sizeof(int))={2:0}, pdata={-2146959343:0}, pdata={-2146959343:0}, pdata->lo={2:0}] [L628] EXPR pdata->hi VAL [malloc(sizeof(int))={1:0}, malloc(sizeof(int))={2:0}, pdata={-2146959343:0}, pdata={-2146959343:0}, pdata->hi={1:0}] [L628] *(pdata->hi) = 8 VAL [malloc(sizeof(int))={1:0}, malloc(sizeof(int))={2:0}, pdata={-2146959343:0}, pdata={-2146959343:0}, pdata->hi={1:0}] [L643] RET alloc_data(&data) VAL [data={-2146959343:0}] [L644] CALL free_data(&data) VAL [data={-2146959343:0}] [L632] EXPR data->lo VAL [data={-2146959343:0}, data={-2146959343:0}, data->lo={2:0}] [L632] int *lo = data->lo; [L633] EXPR data->hi VAL [data={-2146959343:0}, data={-2146959343:0}, data->hi={1:0}, lo={2:0}] [L633] int *hi = data->hi; [L634] EXPR \read(*lo) VAL [\read(*lo)=4, data={-2146959343:0}, data={-2146959343:0}, hi={1:0}, lo={2:0}] [L634] EXPR \read(*hi) VAL [\read(*hi)=8, \read(*lo)=4, data={-2146959343:0}, data={-2146959343:0}, hi={1:0}, lo={2:0}] [L634] COND FALSE !(*lo >= *hi) [L638] data->lo = ((void *)0) VAL [data={-2146959343:0}, data={-2146959343:0}, hi={1:0}, lo={2:0}] [L639] data->hi = ((void *)0) VAL [data={-2146959343:0}, data={-2146959343:0}, hi={1:0}, lo={2:0}] [L644] RET free_data(&data) VAL [data={-2146959343:0}] [L645] return 0; [L645] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 74 locations, 31 error locations. UNSAFE Result, 159.4s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 111.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 560 SDtfs, 775 SDslu, 2599 SDs, 0 SdLazy, 3823 SolverSat, 225 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 22.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 439 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 102.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 27 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 44.7s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 318 ConstructedInterpolants, 37 QuantifiedInterpolants, 221038 SizeOfPredicates, 166 NumberOfNonLiveVariables, 1703 ConjunctsInSsa, 340 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...