./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/test-0019_1_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6808c66573fa9f309265139cf6a41427fc3491cf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:01:52,322 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 19:01:52,324 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 19:01:52,339 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 19:01:52,339 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 19:01:52,340 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 19:01:52,342 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 19:01:52,344 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 19:01:52,346 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 19:01:52,347 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 19:01:52,348 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 19:01:52,348 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 19:01:52,350 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 19:01:52,351 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 19:01:52,352 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 19:01:52,353 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 19:01:52,354 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 19:01:52,356 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 19:01:52,358 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 19:01:52,360 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 19:01:52,361 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 19:01:52,363 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 19:01:52,366 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 19:01:52,366 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 19:01:52,366 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 19:01:52,367 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 19:01:52,369 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 19:01:52,370 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 19:01:52,371 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 19:01:52,372 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 19:01:52,372 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 19:01:52,373 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 19:01:52,373 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 19:01:52,374 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 19:01:52,375 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 19:01:52,376 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 19:01:52,376 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 19:01:52,391 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 19:01:52,391 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 19:01:52,392 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 19:01:52,392 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 19:01:52,393 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 19:01:52,393 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 19:01:52,393 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 19:01:52,393 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 19:01:52,393 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 19:01:52,394 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 19:01:52,397 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 19:01:52,397 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 19:01:52,397 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 19:01:52,397 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 19:01:52,397 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 19:01:52,398 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 19:01:52,398 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 19:01:52,398 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 19:01:52,398 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 19:01:52,398 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 19:01:52,399 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 19:01:52,401 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 19:01:52,401 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 19:01:52,402 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 19:01:52,402 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 19:01:52,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6808c66573fa9f309265139cf6a41427fc3491cf [2019-01-14 19:01:52,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 19:01:52,461 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 19:01:52,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 19:01:52,466 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 19:01:52,466 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 19:01:52,467 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i [2019-01-14 19:01:52,538 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fbea5002/4bf9bb21724342d8be7f4343bf0c8708/FLAGa9d3e1864 [2019-01-14 19:01:52,974 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 19:01:52,974 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i [2019-01-14 19:01:52,991 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fbea5002/4bf9bb21724342d8be7f4343bf0c8708/FLAGa9d3e1864 [2019-01-14 19:01:53,294 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fbea5002/4bf9bb21724342d8be7f4343bf0c8708 [2019-01-14 19:01:53,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 19:01:53,299 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 19:01:53,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 19:01:53,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 19:01:53,304 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 19:01:53,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:01:53" (1/1) ... [2019-01-14 19:01:53,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446481fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:01:53, skipping insertion in model container [2019-01-14 19:01:53,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:01:53" (1/1) ... [2019-01-14 19:01:53,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 19:01:53,367 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 19:01:53,693 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:01:53,712 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 19:01:53,782 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:01:53,905 INFO L195 MainTranslator]: Completed translation [2019-01-14 19:01:53,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:01:53 WrapperNode [2019-01-14 19:01:53,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 19:01:53,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 19:01:53,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 19:01:53,907 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 19:01:53,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:01:53" (1/1) ... [2019-01-14 19:01:53,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:01:53" (1/1) ... [2019-01-14 19:01:53,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:01:53" (1/1) ... [2019-01-14 19:01:53,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:01:53" (1/1) ... [2019-01-14 19:01:53,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:01:53" (1/1) ... [2019-01-14 19:01:53,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:01:53" (1/1) ... [2019-01-14 19:01:53,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:01:53" (1/1) ... [2019-01-14 19:01:53,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 19:01:53,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 19:01:53,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 19:01:53,975 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 19:01:53,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:01:53" (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 19:01:54,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 19:01:54,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 19:01:54,041 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-01-14 19:01:54,041 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-01-14 19:01:54,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 19:01:54,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 19:01:54,042 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 19:01:54,042 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 19:01:54,042 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 19:01:54,042 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 19:01:54,042 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 19:01:54,042 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 19:01:54,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 19:01:54,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 19:01:54,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 19:01:54,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 19:01:54,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 19:01:54,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 19:01:54,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 19:01:54,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 19:01:54,044 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 19:01:54,044 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 19:01:54,044 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 19:01:54,044 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 19:01:54,044 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 19:01:54,044 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 19:01:54,045 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 19:01:54,045 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 19:01:54,045 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 19:01:54,045 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 19:01:54,045 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 19:01:54,045 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 19:01:54,045 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 19:01:54,046 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 19:01:54,046 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 19:01:54,046 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 19:01:54,046 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 19:01:54,046 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 19:01:54,046 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 19:01:54,046 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 19:01:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 19:01:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 19:01:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 19:01:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 19:01:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 19:01:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 19:01:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 19:01:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 19:01:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 19:01:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 19:01:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 19:01:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 19:01:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 19:01:54,049 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 19:01:54,049 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 19:01:54,049 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 19:01:54,049 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 19:01:54,049 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 19:01:54,049 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 19:01:54,050 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 19:01:54,050 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 19:01:54,050 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 19:01:54,050 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 19:01:54,050 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 19:01:54,050 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 19:01:54,051 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 19:01:54,051 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 19:01:54,051 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 19:01:54,051 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 19:01:54,051 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 19:01:54,051 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 19:01:54,051 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 19:01:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 19:01:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 19:01:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 19:01:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 19:01:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 19:01:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 19:01:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 19:01:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 19:01:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 19:01:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 19:01:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 19:01:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 19:01:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 19:01:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 19:01:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 19:01:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 19:01:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 19:01:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 19:01:54,055 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 19:01:54,055 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 19:01:54,055 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 19:01:54,055 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 19:01:54,055 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 19:01:54,055 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 19:01:54,056 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 19:01:54,056 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 19:01:54,056 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 19:01:54,056 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 19:01:54,056 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 19:01:54,056 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 19:01:54,057 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 19:01:54,057 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 19:01:54,057 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 19:01:54,057 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 19:01:54,057 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 19:01:54,057 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-01-14 19:01:54,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 19:01:54,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 19:01:54,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 19:01:54,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 19:01:54,058 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-01-14 19:01:54,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 19:01:54,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 19:01:54,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 19:01:54,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 19:01:54,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 19:01:54,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 19:01:54,844 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 19:01:54,844 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-14 19:01:54,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:01:54 BoogieIcfgContainer [2019-01-14 19:01:54,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 19:01:54,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 19:01:54,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 19:01:54,851 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 19:01:54,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 07:01:53" (1/3) ... [2019-01-14 19:01:54,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1841b265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:01:54, skipping insertion in model container [2019-01-14 19:01:54,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:01:53" (2/3) ... [2019-01-14 19:01:54,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1841b265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:01:54, skipping insertion in model container [2019-01-14 19:01:54,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:01:54" (3/3) ... [2019-01-14 19:01:54,856 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_true-valid-memsafety_true-termination.i [2019-01-14 19:01:54,867 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 19:01:54,882 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2019-01-14 19:01:54,901 INFO L257 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2019-01-14 19:01:54,932 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 19:01:54,932 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 19:01:54,933 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 19:01:54,934 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 19:01:54,935 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 19:01:54,935 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 19:01:54,935 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 19:01:54,935 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 19:01:54,936 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 19:01:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-01-14 19:01:54,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 19:01:54,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:01:54,973 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:01:54,976 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:01:54,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:01:54,983 INFO L82 PathProgramCache]: Analyzing trace with hash 962542561, now seen corresponding path program 1 times [2019-01-14 19:01:54,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:01:54,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:01:55,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:01:55,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:01:55,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:01:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:01:55,253 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 19:01:55,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:01:55,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 19:01:55,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:01:55,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:01:55,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:01:55,272 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 5 states. [2019-01-14 19:01:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:01:56,053 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-14 19:01:56,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:01:56,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 19:01:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:01:56,064 INFO L225 Difference]: With dead ends: 74 [2019-01-14 19:01:56,064 INFO L226 Difference]: Without dead ends: 71 [2019-01-14 19:01:56,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:01:56,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-14 19:01:56,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-14 19:01:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 19:01:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-14 19:01:56,104 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 9 [2019-01-14 19:01:56,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:01:56,104 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-14 19:01:56,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:01:56,104 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-14 19:01:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 19:01:56,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:01:56,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:01:56,106 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:01:56,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:01:56,106 INFO L82 PathProgramCache]: Analyzing trace with hash 962542562, now seen corresponding path program 1 times [2019-01-14 19:01:56,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:01:56,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:01:56,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:01:56,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:01:56,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:01:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:01:56,235 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 19:01:56,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:01:56,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 19:01:56,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:01:56,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:01:56,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:01:56,238 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 5 states. [2019-01-14 19:01:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:01:56,573 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-14 19:01:56,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:01:56,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 19:01:56,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:01:56,576 INFO L225 Difference]: With dead ends: 68 [2019-01-14 19:01:56,576 INFO L226 Difference]: Without dead ends: 68 [2019-01-14 19:01:56,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:01:56,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-14 19:01:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-14 19:01:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 19:01:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-14 19:01:56,587 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 9 [2019-01-14 19:01:56,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:01:56,588 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-14 19:01:56,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:01:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-14 19:01:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 19:01:56,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:01:56,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:01:56,589 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:01:56,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:01:56,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1585432099, now seen corresponding path program 1 times [2019-01-14 19:01:56,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:01:56,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:01:56,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:01:56,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:01:56,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:01:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:01:56,798 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 19:01:56,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:01:56,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:01:56,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 19:01:56,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 19:01:56,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:01:56,801 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 6 states. [2019-01-14 19:01:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:01:57,019 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-14 19:01:57,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 19:01:57,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-14 19:01:57,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:01:57,021 INFO L225 Difference]: With dead ends: 65 [2019-01-14 19:01:57,022 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 19:01:57,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:01:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 19:01:57,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-14 19:01:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 19:01:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-14 19:01:57,029 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 11 [2019-01-14 19:01:57,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:01:57,030 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-14 19:01:57,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 19:01:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-14 19:01:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 19:01:57,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:01:57,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:01:57,031 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:01:57,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:01:57,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1113144155, now seen corresponding path program 1 times [2019-01-14 19:01:57,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:01:57,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:01:57,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:01:57,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:01:57,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:01:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:01:57,163 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 19:01:57,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:01:57,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 19:01:57,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:01:57,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:01:57,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:01:57,165 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 5 states. [2019-01-14 19:01:57,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:01:57,385 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-14 19:01:57,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 19:01:57,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-14 19:01:57,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:01:57,388 INFO L225 Difference]: With dead ends: 64 [2019-01-14 19:01:57,388 INFO L226 Difference]: Without dead ends: 64 [2019-01-14 19:01:57,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:01:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-14 19:01:57,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-14 19:01:57,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-14 19:01:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-14 19:01:57,394 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 13 [2019-01-14 19:01:57,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:01:57,395 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-14 19:01:57,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:01:57,395 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-14 19:01:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 19:01:57,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:01:57,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:01:57,396 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:01:57,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:01:57,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1113144154, now seen corresponding path program 1 times [2019-01-14 19:01:57,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:01:57,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:01:57,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:01:57,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:01:57,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:01:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:01:57,573 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 19:01:57,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:01:57,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 19:01:57,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:01:57,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:01:57,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:01:57,575 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 5 states. [2019-01-14 19:01:57,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:01:57,747 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-14 19:01:57,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 19:01:57,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-14 19:01:57,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:01:57,752 INFO L225 Difference]: With dead ends: 63 [2019-01-14 19:01:57,753 INFO L226 Difference]: Without dead ends: 63 [2019-01-14 19:01:57,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:01:57,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-14 19:01:57,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-14 19:01:57,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 19:01:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-14 19:01:57,759 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 13 [2019-01-14 19:01:57,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:01:57,759 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-14 19:01:57,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:01:57,760 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-14 19:01:57,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 19:01:57,760 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:01:57,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:01:57,761 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:01:57,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:01:57,761 INFO L82 PathProgramCache]: Analyzing trace with hash -235031140, now seen corresponding path program 1 times [2019-01-14 19:01:57,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:01:57,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:01:57,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:01:57,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:01:57,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:01:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:01:58,154 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 19:01:58,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:01:58,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 19:01:58,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 19:01:58,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 19:01:58,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:01:58,157 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 11 states. [2019-01-14 19:01:58,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:01:58,602 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-14 19:01:58,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 19:01:58,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-14 19:01:58,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:01:58,604 INFO L225 Difference]: With dead ends: 62 [2019-01-14 19:01:58,605 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 19:01:58,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-01-14 19:01:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 19:01:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-14 19:01:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-14 19:01:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-14 19:01:58,612 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 16 [2019-01-14 19:01:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:01:58,612 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-14 19:01:58,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 19:01:58,613 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-14 19:01:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 19:01:58,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:01:58,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:01:58,614 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:01:58,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:01:58,614 INFO L82 PathProgramCache]: Analyzing trace with hash -235031139, now seen corresponding path program 1 times [2019-01-14 19:01:58,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:01:58,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:01:58,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:01:58,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:01:58,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:01:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:01:58,882 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 19:01:58,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:01:58,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 19:01:58,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 19:01:58,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 19:01:58,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:01:58,883 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 11 states. [2019-01-14 19:01:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:01:59,711 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-14 19:01:59,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 19:01:59,715 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-14 19:01:59,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:01:59,716 INFO L225 Difference]: With dead ends: 61 [2019-01-14 19:01:59,716 INFO L226 Difference]: Without dead ends: 61 [2019-01-14 19:01:59,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-01-14 19:01:59,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-14 19:01:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-14 19:01:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-14 19:01:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-14 19:01:59,722 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 16 [2019-01-14 19:01:59,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:01:59,722 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-14 19:01:59,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 19:01:59,722 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-14 19:01:59,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 19:01:59,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:01:59,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:01:59,724 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:01:59,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:01:59,724 INFO L82 PathProgramCache]: Analyzing trace with hash -132319012, now seen corresponding path program 1 times [2019-01-14 19:01:59,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:01:59,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:01:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:01:59,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:01:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:01:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:01:59,810 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 19:01:59,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:01:59,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 19:01:59,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 19:01:59,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 19:01:59,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:01:59,811 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 3 states. [2019-01-14 19:01:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:01:59,944 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-01-14 19:01:59,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 19:01:59,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 19:01:59,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:01:59,947 INFO L225 Difference]: With dead ends: 57 [2019-01-14 19:01:59,947 INFO L226 Difference]: Without dead ends: 57 [2019-01-14 19:01:59,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:01:59,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-14 19:01:59,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-14 19:01:59,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 19:01:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-14 19:01:59,952 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 24 [2019-01-14 19:01:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:01:59,953 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-14 19:01:59,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 19:01:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-14 19:01:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 19:01:59,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:01:59,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:01:59,956 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:01:59,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:01:59,956 INFO L82 PathProgramCache]: Analyzing trace with hash -132319011, now seen corresponding path program 1 times [2019-01-14 19:01:59,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:01:59,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:01:59,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:01:59,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:01:59,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:02:00,140 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 19:02:00,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:02:00,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 19:02:00,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 19:02:00,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 19:02:00,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:02:00,142 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 3 states. [2019-01-14 19:02:00,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:02:00,479 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-14 19:02:00,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 19:02:00,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 19:02:00,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:02:00,480 INFO L225 Difference]: With dead ends: 53 [2019-01-14 19:02:00,481 INFO L226 Difference]: Without dead ends: 53 [2019-01-14 19:02:00,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:02:00,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-14 19:02:00,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-14 19:02:00,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 19:02:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-14 19:02:00,492 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 24 [2019-01-14 19:02:00,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:02:00,492 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-14 19:02:00,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 19:02:00,496 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-14 19:02:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 19:02:00,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:02:00,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:02:00,497 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:02:00,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:02:00,498 INFO L82 PathProgramCache]: Analyzing trace with hash 99646529, now seen corresponding path program 1 times [2019-01-14 19:02:00,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:02:00,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:02:00,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:00,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:02:00,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:02:00,870 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 19:02:01,089 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-01-14 19:02:01,337 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 19:02:01,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:02:01,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-01-14 19:02:01,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 19:02:01,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 19:02:01,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-01-14 19:02:01,339 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 18 states. [2019-01-14 19:02:01,794 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-01-14 19:02:02,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:02:02,362 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-14 19:02:02,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 19:02:02,363 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-01-14 19:02:02,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:02:02,365 INFO L225 Difference]: With dead ends: 51 [2019-01-14 19:02:02,365 INFO L226 Difference]: Without dead ends: 51 [2019-01-14 19:02:02,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2019-01-14 19:02:02,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-14 19:02:02,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-14 19:02:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-14 19:02:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-14 19:02:02,370 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 30 [2019-01-14 19:02:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:02:02,370 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-14 19:02:02,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 19:02:02,370 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-14 19:02:02,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 19:02:02,371 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:02:02,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:02:02,372 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:02:02,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:02:02,372 INFO L82 PathProgramCache]: Analyzing trace with hash 99646530, now seen corresponding path program 1 times [2019-01-14 19:02:02,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:02:02,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:02:02,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:02,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:02:02,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:02:03,268 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 19:02:03,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:02:03,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-01-14 19:02:03,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 19:02:03,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 19:02:03,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-01-14 19:02:03,269 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 18 states. [2019-01-14 19:02:04,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:02:04,511 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-14 19:02:04,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 19:02:04,513 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-01-14 19:02:04,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:02:04,514 INFO L225 Difference]: With dead ends: 49 [2019-01-14 19:02:04,514 INFO L226 Difference]: Without dead ends: 49 [2019-01-14 19:02:04,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2019-01-14 19:02:04,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-14 19:02:04,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-14 19:02:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-14 19:02:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-14 19:02:04,518 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 30 [2019-01-14 19:02:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:02:04,518 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-14 19:02:04,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 19:02:04,518 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-14 19:02:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 19:02:04,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:02:04,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:02:04,520 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:02:04,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:02:04,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1205924872, now seen corresponding path program 1 times [2019-01-14 19:02:04,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:02:04,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:02:04,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:04,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:02:04,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:02:05,248 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 19:02:05,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:02:05,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-01-14 19:02:05,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 19:02:05,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 19:02:05,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-01-14 19:02:05,250 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 18 states. [2019-01-14 19:02:06,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:02:06,556 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-14 19:02:06,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 19:02:06,557 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-01-14 19:02:06,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:02:06,559 INFO L225 Difference]: With dead ends: 48 [2019-01-14 19:02:06,559 INFO L226 Difference]: Without dead ends: 48 [2019-01-14 19:02:06,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2019-01-14 19:02:06,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-14 19:02:06,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-14 19:02:06,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 19:02:06,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-14 19:02:06,563 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 31 [2019-01-14 19:02:06,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:02:06,563 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-14 19:02:06,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 19:02:06,563 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-14 19:02:06,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 19:02:06,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:02:06,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:02:06,565 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:02:06,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:02:06,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1205924871, now seen corresponding path program 1 times [2019-01-14 19:02:06,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:02:06,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:02:06,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:06,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:02:06,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:02:07,288 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 19:02:07,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:02:07,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-01-14 19:02:07,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 19:02:07,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 19:02:07,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-01-14 19:02:07,290 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 18 states. [2019-01-14 19:02:07,944 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-01-14 19:02:08,108 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-14 19:02:08,460 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-01-14 19:02:09,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:02:09,079 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-14 19:02:09,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-14 19:02:09,081 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-01-14 19:02:09,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:02:09,082 INFO L225 Difference]: With dead ends: 46 [2019-01-14 19:02:09,082 INFO L226 Difference]: Without dead ends: 46 [2019-01-14 19:02:09,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 19:02:09,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-14 19:02:09,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-14 19:02:09,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 19:02:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-14 19:02:09,086 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 31 [2019-01-14 19:02:09,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:02:09,087 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-14 19:02:09,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 19:02:09,087 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-14 19:02:09,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 19:02:09,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:02:09,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:02:09,088 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:02:09,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:02:09,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1693600135, now seen corresponding path program 1 times [2019-01-14 19:02:09,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:02:09,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:02:09,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:09,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:02:09,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:02:09,512 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 19:02:09,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:02:09,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-14 19:02:09,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 19:02:09,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 19:02:09,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-01-14 19:02:09,515 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 17 states. [2019-01-14 19:02:10,280 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2019-01-14 19:02:10,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:02:10,797 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-14 19:02:10,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 19:02:10,798 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-01-14 19:02:10,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:02:10,799 INFO L225 Difference]: With dead ends: 45 [2019-01-14 19:02:10,799 INFO L226 Difference]: Without dead ends: 45 [2019-01-14 19:02:10,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2019-01-14 19:02:10,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-14 19:02:10,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-14 19:02:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 19:02:10,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-14 19:02:10,802 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 34 [2019-01-14 19:02:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:02:10,803 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-14 19:02:10,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 19:02:10,803 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-14 19:02:10,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 19:02:10,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:02:10,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:02:10,804 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:02:10,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:02:10,805 INFO L82 PathProgramCache]: Analyzing trace with hash -243454578, now seen corresponding path program 1 times [2019-01-14 19:02:10,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:02:10,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:02:10,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:10,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:02:10,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:02:11,078 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-14 19:02:11,399 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 15 [2019-01-14 19:02:11,822 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-01-14 19:02:12,729 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 19:02:12,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:02:12,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-01-14 19:02:12,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-14 19:02:12,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-14 19:02:12,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-01-14 19:02:12,731 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 25 states. [2019-01-14 19:02:13,399 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-01-14 19:02:13,609 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-14 19:02:13,875 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-01-14 19:02:14,091 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-01-14 19:02:15,138 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-01-14 19:02:15,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:02:15,461 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2019-01-14 19:02:15,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-14 19:02:15,468 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 36 [2019-01-14 19:02:15,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:02:15,469 INFO L225 Difference]: With dead ends: 47 [2019-01-14 19:02:15,469 INFO L226 Difference]: Without dead ends: 45 [2019-01-14 19:02:15,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=178, Invalid=1802, Unknown=0, NotChecked=0, Total=1980 [2019-01-14 19:02:15,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-14 19:02:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-14 19:02:15,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 19:02:15,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 44 transitions. [2019-01-14 19:02:15,475 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 44 transitions. Word has length 36 [2019-01-14 19:02:15,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:02:15,475 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 44 transitions. [2019-01-14 19:02:15,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-14 19:02:15,476 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 44 transitions. [2019-01-14 19:02:15,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-14 19:02:15,476 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:02:15,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:02:15,480 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:02:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:02:15,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1060892060, now seen corresponding path program 1 times [2019-01-14 19:02:15,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:02:15,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:02:15,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:15,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:02:15,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:02:15,981 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 19:02:15,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:02:15,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-14 19:02:15,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 19:02:15,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 19:02:15,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-01-14 19:02:15,983 INFO L87 Difference]: Start difference. First operand 45 states and 44 transitions. Second operand 17 states. [2019-01-14 19:02:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:02:16,795 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2019-01-14 19:02:16,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 19:02:16,796 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2019-01-14 19:02:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:02:16,797 INFO L225 Difference]: With dead ends: 44 [2019-01-14 19:02:16,797 INFO L226 Difference]: Without dead ends: 44 [2019-01-14 19:02:16,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2019-01-14 19:02:16,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-14 19:02:16,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-14 19:02:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-14 19:02:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2019-01-14 19:02:16,800 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 37 [2019-01-14 19:02:16,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:02:16,801 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2019-01-14 19:02:16,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 19:02:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2019-01-14 19:02:16,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 19:02:16,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:02:16,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:02:16,802 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:02:16,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:02:16,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1472084405, now seen corresponding path program 1 times [2019-01-14 19:02:16,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:02:16,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:02:16,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:16,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:02:16,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:02:17,345 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-01-14 19:02:17,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 19:02:17,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:02:17,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-01-14 19:02:17,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-14 19:02:17,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-14 19:02:17,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-01-14 19:02:17,738 INFO L87 Difference]: Start difference. First operand 44 states and 43 transitions. Second operand 23 states. [2019-01-14 19:02:18,182 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-01-14 19:02:19,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:02:19,430 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2019-01-14 19:02:19,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-14 19:02:19,430 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 38 [2019-01-14 19:02:19,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:02:19,431 INFO L225 Difference]: With dead ends: 43 [2019-01-14 19:02:19,431 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 19:02:19,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=193, Invalid=1529, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 19:02:19,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 19:02:19,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-14 19:02:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 19:02:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2019-01-14 19:02:19,434 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 38 [2019-01-14 19:02:19,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:02:19,438 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2019-01-14 19:02:19,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-14 19:02:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2019-01-14 19:02:19,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 19:02:19,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:02:19,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:02:19,440 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 19:02:19,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:02:19,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1975478987, now seen corresponding path program 1 times [2019-01-14 19:02:19,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:02:19,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:02:19,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:19,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:02:19,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:02:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:02:20,145 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-01-14 19:02:20,380 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 41 [2019-01-14 19:02:20,625 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-01-14 19:02:20,819 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-01-14 19:02:22,589 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 19:02:22,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:02:22,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-01-14 19:02:22,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-14 19:02:22,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-14 19:02:22,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2019-01-14 19:02:22,590 INFO L87 Difference]: Start difference. First operand 43 states and 42 transitions. Second operand 25 states. [2019-01-14 19:02:23,136 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-01-14 19:02:23,379 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-01-14 19:02:23,628 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-01-14 19:02:24,767 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-01-14 19:02:24,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:02:24,940 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2019-01-14 19:02:24,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-14 19:02:24,941 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2019-01-14 19:02:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:02:24,942 INFO L225 Difference]: With dead ends: 42 [2019-01-14 19:02:24,942 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 19:02:24,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2019-01-14 19:02:24,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 19:02:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 19:02:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 19:02:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 19:02:24,944 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2019-01-14 19:02:24,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:02:24,944 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 19:02:24,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-14 19:02:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 19:02:24,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 19:02:24,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 07:02:24 BoogieIcfgContainer [2019-01-14 19:02:24,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 19:02:24,950 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 19:02:24,951 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 19:02:24,951 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 19:02:24,951 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:01:54" (3/4) ... [2019-01-14 19:02:24,956 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 19:02:24,964 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 19:02:24,964 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_data [2019-01-14 19:02:24,964 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 19:02:24,965 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_data [2019-01-14 19:02:24,971 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-01-14 19:02:24,971 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-14 19:02:24,971 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 19:02:25,035 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 19:02:25,035 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 19:02:25,036 INFO L168 Benchmark]: Toolchain (without parser) took 31737.76 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 405.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -101.9 MB). Peak memory consumption was 303.9 MB. Max. memory is 11.5 GB. [2019-01-14 19:02:25,037 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:02:25,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 606.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -181.9 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-01-14 19:02:25,038 INFO L168 Benchmark]: Boogie Preprocessor took 67.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 19:02:25,039 INFO L168 Benchmark]: RCFGBuilder took 872.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. [2019-01-14 19:02:25,039 INFO L168 Benchmark]: TraceAbstraction took 30102.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 265.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.5 MB). Peak memory consumption was 280.8 MB. Max. memory is 11.5 GB. [2019-01-14 19:02:25,044 INFO L168 Benchmark]: Witness Printer took 84.68 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-14 19:02:25,048 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 606.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -181.9 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 872.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30102.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 265.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.5 MB). Peak memory consumption was 280.8 MB. Max. memory is 11.5 GB. * Witness Printer took 84.68 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference 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: 639]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: 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: 637]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 630]: 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: 637]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 637]: free always succeeds For all program executions holds that free 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: 636]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 636]: free always succeeds For all program executions holds that free 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: 636]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 80 locations, 35 error locations. SAFE Result, 30.0s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 17.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 626 SDtfs, 732 SDslu, 2706 SDs, 0 SdLazy, 4946 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 19.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 444 NumberOfCodeBlocks, 444 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 426 ConstructedInterpolants, 0 QuantifiedInterpolants, 251795 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...