./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memcleanup.prp --file /storage/repos/svcomp/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 0ed9222f 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/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9becd42a466bdbd2531661a22b57e70854c9d9ea .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 00:37:49,437 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 00:37:49,438 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 00:37:49,458 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 00:37:49,460 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 00:37:49,461 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 00:37:49,462 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 00:37:49,464 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 00:37:49,466 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 00:37:49,467 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 00:37:49,468 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 00:37:49,468 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 00:37:49,469 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 00:37:49,470 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 00:37:49,472 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 00:37:49,473 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 00:37:49,474 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 00:37:49,478 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 00:37:49,482 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 00:37:49,483 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 00:37:49,485 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 00:37:49,490 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 00:37:49,493 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 00:37:49,494 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 00:37:49,495 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 00:37:49,496 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 00:37:49,496 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 00:37:49,498 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 00:37:49,499 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 00:37:49,501 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 00:37:49,502 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 00:37:49,504 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 00:37:49,505 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 00:37:49,506 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 00:37:49,507 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 00:37:49,508 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 00:37:49,509 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-01-14 00:37:49,529 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 00:37:49,529 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 00:37:49,530 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 00:37:49,530 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 00:37:49,531 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 00:37:49,531 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 00:37:49,531 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 00:37:49,531 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 00:37:49,531 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 00:37:49,532 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 00:37:49,532 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 00:37:49,532 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 00:37:49,532 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 00:37:49,532 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 00:37:49,532 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 00:37:49,533 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 00:37:49,533 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 00:37:49,533 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 00:37:49,533 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 00:37:49,533 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 00:37:49,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:37:49,534 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 00:37:49,534 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 00:37:49,534 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 00:37:49,534 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 00:37:49,534 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9becd42a466bdbd2531661a22b57e70854c9d9ea [2019-01-14 00:37:49,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 00:37:49,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 00:37:49,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 00:37:49,588 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 00:37:49,588 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 00:37:49,590 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2019-01-14 00:37:49,648 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b693edae5/6c76eabe95d74afdbaaea2035f15cf77/FLAG94299823e [2019-01-14 00:37:50,123 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 00:37:50,124 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2019-01-14 00:37:50,140 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b693edae5/6c76eabe95d74afdbaaea2035f15cf77/FLAG94299823e [2019-01-14 00:37:50,422 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b693edae5/6c76eabe95d74afdbaaea2035f15cf77 [2019-01-14 00:37:50,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 00:37:50,427 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 00:37:50,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 00:37:50,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 00:37:50,434 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 00:37:50,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:37:50" (1/1) ... [2019-01-14 00:37:50,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d33055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:50, skipping insertion in model container [2019-01-14 00:37:50,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:37:50" (1/1) ... [2019-01-14 00:37:50,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 00:37:50,509 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 00:37:50,875 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:37:50,887 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 00:37:50,930 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:37:51,124 INFO L195 MainTranslator]: Completed translation [2019-01-14 00:37:51,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:51 WrapperNode [2019-01-14 00:37:51,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 00:37:51,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 00:37:51,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 00:37:51,126 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 00:37:51,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:51" (1/1) ... [2019-01-14 00:37:51,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:51" (1/1) ... [2019-01-14 00:37:51,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:51" (1/1) ... [2019-01-14 00:37:51,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:51" (1/1) ... [2019-01-14 00:37:51,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:51" (1/1) ... [2019-01-14 00:37:51,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:51" (1/1) ... [2019-01-14 00:37:51,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:51" (1/1) ... [2019-01-14 00:37:51,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 00:37:51,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 00:37:51,219 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 00:37:51,219 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 00:37:51,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37: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-14 00:37:51,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 00:37:51,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 00:37:51,294 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-14 00:37:51,294 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 00:37:51,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 00:37:51,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 00:37:51,295 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 00:37:51,295 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 00:37:51,295 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 00:37:51,295 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 00:37:51,295 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 00:37:51,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 00:37:51,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 00:37:51,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 00:37:51,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 00:37:51,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 00:37:51,297 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 00:37:51,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 00:37:51,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 00:37:51,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 00:37:51,299 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 00:37:51,299 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 00:37:51,299 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 00:37:51,299 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 00:37:51,300 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 00:37:51,301 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 00:37:51,301 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 00:37:51,301 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 00:37:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 00:37:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 00:37:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 00:37:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 00:37:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 00:37:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 00:37:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 00:37:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 00:37:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 00:37:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 00:37:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 00:37:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 00:37:51,304 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 00:37:51,304 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 00:37:51,304 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 00:37:51,304 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 00:37:51,304 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 00:37:51,304 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 00:37:51,304 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 00:37:51,305 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 00:37:51,305 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 00:37:51,305 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 00:37:51,305 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 00:37:51,305 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 00:37:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 00:37:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 00:37:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 00:37:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 00:37:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 00:37:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 00:37:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 00:37:51,307 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 00:37:51,307 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 00:37:51,307 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 00:37:51,307 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 00:37:51,307 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 00:37:51,307 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 00:37:51,308 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 00:37:51,308 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 00:37:51,308 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 00:37:51,308 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 00:37:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 00:37:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 00:37:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 00:37:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 00:37:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 00:37:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 00:37:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 00:37:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 00:37:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 00:37:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 00:37:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 00:37:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 00:37:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 00:37:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 00:37:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 00:37:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 00:37:51,312 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 00:37:51,312 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 00:37:51,312 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 00:37:51,312 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 00:37:51,312 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 00:37:51,312 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 00:37:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 00:37:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 00:37:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 00:37:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 00:37:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 00:37:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 00:37:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 00:37:51,314 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 00:37:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 00:37:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 00:37:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 00:37:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 00:37:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 00:37:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 00:37:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 00:37:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 00:37:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-14 00:37:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 00:37:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 00:37:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 00:37:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 00:37:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 00:37:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 00:37:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 00:37:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 00:37:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 00:37:51,763 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-14 00:37:52,237 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 00:37:52,237 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-14 00:37:52,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:37:52 BoogieIcfgContainer [2019-01-14 00:37:52,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 00:37:52,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 00:37:52,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 00:37:52,243 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 00:37:52,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 12:37:50" (1/3) ... [2019-01-14 00:37:52,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f1a10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:37:52, skipping insertion in model container [2019-01-14 00:37:52,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:51" (2/3) ... [2019-01-14 00:37:52,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f1a10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:37:52, skipping insertion in model container [2019-01-14 00:37:52,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:37:52" (3/3) ... [2019-01-14 00:37:52,247 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2019-01-14 00:37:52,257 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 00:37:52,266 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-01-14 00:37:52,283 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-01-14 00:37:52,310 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 00:37:52,311 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 00:37:52,311 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 00:37:52,312 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 00:37:52,312 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 00:37:52,312 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 00:37:52,312 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 00:37:52,312 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 00:37:52,312 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 00:37:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-01-14 00:37:52,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 00:37:52,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:52,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:52,344 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2019-01-14 00:37:52,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:52,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1029241619, now seen corresponding path program 1 times [2019-01-14 00:37:52,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:52,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:52,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:52,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:52,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:52,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-14 00:37:52,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:52,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:37:52,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 00:37:52,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 00:37:52,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 00:37:52,523 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2019-01-14 00:37:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:52,546 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-01-14 00:37:52,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 00:37:52,547 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-14 00:37:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:52,557 INFO L225 Difference]: With dead ends: 62 [2019-01-14 00:37:52,557 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 00:37:52,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 00:37:52,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 00:37:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-14 00:37:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-14 00:37:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-01-14 00:37:52,604 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 10 [2019-01-14 00:37:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:52,605 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-01-14 00:37:52,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 00:37:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-01-14 00:37:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 00:37:52,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:52,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:52,607 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2019-01-14 00:37:52,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:52,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1257765420, now seen corresponding path program 1 times [2019-01-14 00:37:52,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:52,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:52,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:52,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:52,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:52,736 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-14 00:37:52,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:52,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 00:37:52,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 00:37:52,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 00:37:52,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:37:52,739 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 4 states. [2019-01-14 00:37:53,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:53,140 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-01-14 00:37:53,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:37:53,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-14 00:37:53,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:53,144 INFO L225 Difference]: With dead ends: 72 [2019-01-14 00:37:53,144 INFO L226 Difference]: Without dead ends: 72 [2019-01-14 00:37:53,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:37:53,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-14 00:37:53,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2019-01-14 00:37:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-14 00:37:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-01-14 00:37:53,153 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 12 [2019-01-14 00:37:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:53,154 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-01-14 00:37:53,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 00:37:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-01-14 00:37:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 00:37:53,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:53,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:53,155 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2019-01-14 00:37:53,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:53,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1257765421, now seen corresponding path program 1 times [2019-01-14 00:37:53,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:53,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:53,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:53,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:53,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:53,312 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-14 00:37:53,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:53,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 00:37:53,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 00:37:53,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 00:37:53,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:37:53,315 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 4 states. [2019-01-14 00:37:53,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:53,837 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-01-14 00:37:53,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:37:53,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-14 00:37:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:53,839 INFO L225 Difference]: With dead ends: 77 [2019-01-14 00:37:53,839 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 00:37:53,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:37:53,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 00:37:53,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2019-01-14 00:37:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-14 00:37:53,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2019-01-14 00:37:53,850 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 12 [2019-01-14 00:37:53,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:53,851 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2019-01-14 00:37:53,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 00:37:53,851 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2019-01-14 00:37:53,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 00:37:53,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:53,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:53,852 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2019-01-14 00:37:53,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:53,853 INFO L82 PathProgramCache]: Analyzing trace with hash 346242173, now seen corresponding path program 1 times [2019-01-14 00:37:53,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:53,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:53,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:53,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:53,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:53,929 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-14 00:37:53,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:53,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:37:53,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:37:53,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:37:53,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:37:53,931 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 5 states. [2019-01-14 00:37:54,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:54,359 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-01-14 00:37:54,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:37:54,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-01-14 00:37:54,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:54,361 INFO L225 Difference]: With dead ends: 73 [2019-01-14 00:37:54,361 INFO L226 Difference]: Without dead ends: 73 [2019-01-14 00:37:54,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:37:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-14 00:37:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2019-01-14 00:37:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-14 00:37:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2019-01-14 00:37:54,371 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 19 [2019-01-14 00:37:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:54,371 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2019-01-14 00:37:54,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:37:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2019-01-14 00:37:54,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 00:37:54,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:54,374 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:54,374 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2019-01-14 00:37:54,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:54,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1024733948, now seen corresponding path program 1 times [2019-01-14 00:37:54,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:54,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:54,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:54,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:54,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:54,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:54,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 00:37:54,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:37:54,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:37:54,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:37:54,552 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 7 states. [2019-01-14 00:37:54,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:54,847 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-01-14 00:37:54,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:37:54,848 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-14 00:37:54,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:54,850 INFO L225 Difference]: With dead ends: 82 [2019-01-14 00:37:54,851 INFO L226 Difference]: Without dead ends: 76 [2019-01-14 00:37:54,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:37:54,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-14 00:37:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-01-14 00:37:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 00:37:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-01-14 00:37:54,860 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 21 [2019-01-14 00:37:54,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:54,860 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-01-14 00:37:54,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:37:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-01-14 00:37:54,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 00:37:54,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:54,862 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:54,862 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2019-01-14 00:37:54,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:54,864 INFO L82 PathProgramCache]: Analyzing trace with hash 399282864, now seen corresponding path program 1 times [2019-01-14 00:37:54,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:54,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:54,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:54,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:54,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:54,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:54,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:37:54,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:37:54,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:37:54,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:37:54,977 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2019-01-14 00:37:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:55,171 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-01-14 00:37:55,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:37:55,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-14 00:37:55,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:55,174 INFO L225 Difference]: With dead ends: 66 [2019-01-14 00:37:55,174 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 00:37:55,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:37:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 00:37:55,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-01-14 00:37:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 00:37:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-01-14 00:37:55,182 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 21 [2019-01-14 00:37:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:55,182 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-01-14 00:37:55,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:37:55,182 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-01-14 00:37:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 00:37:55,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:55,183 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:55,184 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2019-01-14 00:37:55,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:55,186 INFO L82 PathProgramCache]: Analyzing trace with hash 399282865, now seen corresponding path program 1 times [2019-01-14 00:37:55,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:55,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:55,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:55,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:55,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:55,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:55,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:37:55,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:37:55,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:37:55,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:37:55,363 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2019-01-14 00:37:55,757 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 00:37:55,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:55,880 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-01-14 00:37:55,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:37:55,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-14 00:37:55,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:55,881 INFO L225 Difference]: With dead ends: 59 [2019-01-14 00:37:55,881 INFO L226 Difference]: Without dead ends: 59 [2019-01-14 00:37:55,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:37:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-14 00:37:55,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-01-14 00:37:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 00:37:55,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-01-14 00:37:55,888 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 21 [2019-01-14 00:37:55,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:55,888 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-01-14 00:37:55,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:37:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-01-14 00:37:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 00:37:55,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:55,891 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 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-14 00:37:55,891 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2019-01-14 00:37:55,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:55,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1247770368, now seen corresponding path program 1 times [2019-01-14 00:37:55,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:55,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:55,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:55,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:55,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:56,283 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-01-14 00:37:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:56,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:56,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:56,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:56,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:56,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 6 treesize of output 5 [2019-01-14 00:37:56,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:56,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:56,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 00:37:56,652 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-14 00:37:56,675 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-14 00:37:56,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:56,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:56,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:56,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-01-14 00:37:56,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,963 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-14 00:37:56,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-01-14 00:37:57,071 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-14 00:37:57,077 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 10 treesize of output 9 [2019-01-14 00:37:57,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,123 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 27 treesize of output 22 [2019-01-14 00:37:57,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:57,135 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 22 treesize of output 14 [2019-01-14 00:37:57,136 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,146 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,164 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-14 00:37:57,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2019-01-14 00:37:57,215 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 20 treesize of output 16 [2019-01-14 00:37:57,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2019-01-14 00:37:57,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2019-01-14 00:37:57,305 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 19 treesize of output 20 [2019-01-14 00:37:57,308 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-14 00:37:57,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,327 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-14 00:37:57,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2019-01-14 00:37:57,345 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 27 treesize of output 28 [2019-01-14 00:37:57,350 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 16 treesize of output 1 [2019-01-14 00:37:57,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:14 [2019-01-14 00:37:57,464 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-14 00:37:57,467 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-14 00:37:57,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-01-14 00:37:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:57,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:57,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-01-14 00:37:57,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 00:37:57,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 00:37:57,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-01-14 00:37:57,581 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 21 states. [2019-01-14 00:37:58,327 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-14 00:37:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:58,834 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2019-01-14 00:37:58,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 00:37:58,835 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-01-14 00:37:58,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:58,836 INFO L225 Difference]: With dead ends: 83 [2019-01-14 00:37:58,836 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 00:37:58,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2019-01-14 00:37:58,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 00:37:58,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2019-01-14 00:37:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-14 00:37:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-01-14 00:37:58,843 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 30 [2019-01-14 00:37:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:58,843 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-01-14 00:37:58,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 00:37:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-01-14 00:37:58,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 00:37:58,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:58,846 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:58,847 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION]=== [2019-01-14 00:37:58,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:58,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1420195708, now seen corresponding path program 2 times [2019-01-14 00:37:58,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:58,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:58,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:58,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:58,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:59,559 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-14 00:37:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:59,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:59,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:59,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:37:59,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:37:59,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:59,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:59,861 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-14 00:37:59,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:59,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:59,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 00:37:59,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,969 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-14 00:37:59,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:59,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:59,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-01-14 00:38:00,020 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-14 00:38:00,035 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 10 treesize of output 9 [2019-01-14 00:38:00,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:00,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:00,054 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-14 00:38:00,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2019-01-14 00:38:00,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:00,174 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 35 treesize of output 36 [2019-01-14 00:38:00,187 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 12 treesize of output 1 [2019-01-14 00:38:00,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:00,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:00,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:00,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:28 [2019-01-14 00:38:00,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:00,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:00,226 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-14 00:38:00,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:00,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:00,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2019-01-14 00:38:00,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:00,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2019-01-14 00:38:00,279 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 10 treesize of output 9 [2019-01-14 00:38:00,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:00,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:00,300 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-14 00:38:00,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:38 [2019-01-14 00:38:00,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:00,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 79 [2019-01-14 00:38:00,679 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 79 treesize of output 67 [2019-01-14 00:38:00,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:00,779 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 2 case distinctions, treesize of input 48 treesize of output 40 [2019-01-14 00:38:00,780 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 00:38:00,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:38:00,833 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 2 xjuncts. [2019-01-14 00:38:00,833 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:71, output treesize:85 [2019-01-14 00:38:00,911 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 50 treesize of output 44 [2019-01-14 00:38:00,915 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 16 treesize of output 15 [2019-01-14 00:38:00,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:00,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:00,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 76 [2019-01-14 00:38:00,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 64 [2019-01-14 00:38:00,999 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 00:38:01,057 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 63 treesize of output 62 [2019-01-14 00:38:01,058 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:01,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:38:01,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-01-14 00:38:01,290 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:129, output treesize:143 [2019-01-14 00:38:01,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2019-01-14 00:38:01,551 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 7 treesize of output 1 [2019-01-14 00:38:01,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:01,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2019-01-14 00:38:01,580 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:01,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:01,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2019-01-14 00:38:01,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2019-01-14 00:38:01,624 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:01,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2019-01-14 00:38:01,660 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:01,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2019-01-14 00:38:01,679 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:01,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2019-01-14 00:38:01,697 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:01,710 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:01,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:01,721 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:97, output treesize:5 [2019-01-14 00:38:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:38:01,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:38:01,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2019-01-14 00:38:01,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-14 00:38:01,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-14 00:38:01,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2019-01-14 00:38:01,810 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 30 states. [2019-01-14 00:38:03,489 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-01-14 00:38:03,734 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-01-14 00:38:04,016 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-01-14 00:38:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:38:04,495 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-01-14 00:38:04,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-14 00:38:04,496 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 39 [2019-01-14 00:38:04,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:38:04,497 INFO L225 Difference]: With dead ends: 56 [2019-01-14 00:38:04,497 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 00:38:04,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=389, Invalid=2161, Unknown=0, NotChecked=0, Total=2550 [2019-01-14 00:38:04,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 00:38:04,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 00:38:04,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 00:38:04,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 00:38:04,499 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-01-14 00:38:04,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:38:04,500 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 00:38:04,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-14 00:38:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 00:38:04,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 00:38:04,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:38:04 BoogieIcfgContainer [2019-01-14 00:38:04,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 00:38:04,510 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 00:38:04,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 00:38:04,510 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 00:38:04,511 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:37:52" (3/4) ... [2019-01-14 00:38:04,517 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 00:38:04,524 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 00:38:04,524 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-14 00:38:04,524 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 00:38:04,529 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-14 00:38:04,530 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 00:38:04,530 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 00:38:04,593 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 00:38:04,593 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 00:38:04,594 INFO L168 Benchmark]: Toolchain (without parser) took 14167.89 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -115.9 MB). Peak memory consumption was 195.5 MB. Max. memory is 11.5 GB. [2019-01-14 00:38:04,595 INFO L168 Benchmark]: CDTParser took 0.22 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-14 00:38:04,595 INFO L168 Benchmark]: CACSL2BoogieTranslator took 697.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2019-01-14 00:38:04,597 INFO L168 Benchmark]: Boogie Preprocessor took 92.85 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-14 00:38:04,597 INFO L168 Benchmark]: RCFGBuilder took 1019.73 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: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. [2019-01-14 00:38:04,599 INFO L168 Benchmark]: TraceAbstraction took 12269.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 181.5 MB. Max. memory is 11.5 GB. [2019-01-14 00:38:04,599 INFO L168 Benchmark]: Witness Printer took 83.51 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:38:04,602 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.22 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 697.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.85 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1019.73 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: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12269.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 181.5 MB. Max. memory is 11.5 GB. * Witness Printer took 83.51 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 656]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 641]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 656]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 656]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 641]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 63 locations, 20 error locations. SAFE Result, 12.2s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 6.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 308 SDtfs, 687 SDslu, 851 SDs, 0 SdLazy, 1287 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=3, 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 65 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 243 ConstructedInterpolants, 11 QuantifiedInterpolants, 93225 SizeOfPredicates, 33 NumberOfNonLiveVariables, 343 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 14/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...