./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memcleanup.prp --file /storage/repos/svcomp/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version cbd82567 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-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a74485b04ec8988328f8bc8f67ebe898d81e7141 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-cbd8256-m [2018-11-28 11:50:20,232 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:50:20,234 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:50:20,250 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:50:20,250 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:50:20,251 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:50:20,252 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:50:20,254 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:50:20,256 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:50:20,257 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:50:20,258 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:50:20,258 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:50:20,259 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:50:20,260 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:50:20,261 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:50:20,262 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:50:20,263 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:50:20,264 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:50:20,267 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:50:20,268 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:50:20,269 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:50:20,271 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:50:20,273 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:50:20,273 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:50:20,274 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:50:20,275 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:50:20,276 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:50:20,277 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:50:20,277 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:50:20,282 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:50:20,282 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:50:20,283 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:50:20,283 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:50:20,283 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:50:20,288 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:50:20,289 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:50:20,289 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2018-11-28 11:50:20,314 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:50:20,314 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:50:20,315 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:50:20,315 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:50:20,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:50:20,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:50:20,316 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:50:20,317 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:50:20,317 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:50:20,317 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:50:20,317 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:50:20,317 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:50:20,318 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:50:20,318 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 11:50:20,318 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 11:50:20,318 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:50:20,318 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:50:20,318 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:50:20,319 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:50:20,319 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:50:20,319 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:50:20,319 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:50:20,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:50:20,320 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:50:20,320 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:50:20,320 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:50:20,320 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:50:20,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a74485b04ec8988328f8bc8f67ebe898d81e7141 [2018-11-28 11:50:20,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:50:20,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:50:20,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:50:20,383 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:50:20,383 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:50:20,384 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-11-28 11:50:20,457 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a7cb2309/5fa8276c899d4424b177175b517e6b91/FLAGa9181aab6 [2018-11-28 11:50:21,105 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:50:21,106 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-11-28 11:50:21,125 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a7cb2309/5fa8276c899d4424b177175b517e6b91/FLAGa9181aab6 [2018-11-28 11:50:21,324 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a7cb2309/5fa8276c899d4424b177175b517e6b91 [2018-11-28 11:50:21,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:50:21,333 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 11:50:21,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:50:21,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:50:21,342 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:50:21,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:50:21" (1/1) ... [2018-11-28 11:50:21,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a9c66bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:21, skipping insertion in model container [2018-11-28 11:50:21,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:50:21" (1/1) ... [2018-11-28 11:50:21,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:50:21,429 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:50:21,776 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:50:21,794 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:50:21,871 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:50:22,023 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:50:22,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:22 WrapperNode [2018-11-28 11:50:22,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:50:22,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:50:22,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:50:22,027 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:50:22,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:22" (1/1) ... [2018-11-28 11:50:22,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:22" (1/1) ... [2018-11-28 11:50:22,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:22" (1/1) ... [2018-11-28 11:50:22,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:22" (1/1) ... [2018-11-28 11:50:22,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:22" (1/1) ... [2018-11-28 11:50:22,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:22" (1/1) ... [2018-11-28 11:50:22,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:22" (1/1) ... [2018-11-28 11:50:22,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:50:22,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:50:22,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:50:22,101 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:50:22,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:50:22,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:50:22,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:50:22,163 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-11-28 11:50:22,163 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:50:22,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 11:50:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 11:50:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 11:50:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 11:50:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 11:50:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 11:50:22,165 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 11:50:22,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 11:50:22,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 11:50:22,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 11:50:22,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 11:50:22,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 11:50:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 11:50:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 11:50:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 11:50:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 11:50:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 11:50:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 11:50:22,171 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 11:50:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 11:50:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 11:50:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 11:50:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 11:50:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 11:50:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 11:50:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 11:50:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 11:50:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 11:50:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 11:50:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 11:50:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 11:50:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 11:50:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 11:50:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 11:50:22,175 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 11:50:22,175 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 11:50:22,175 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 11:50:22,175 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 11:50:22,175 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 11:50:22,175 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 11:50:22,175 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 11:50:22,177 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 11:50:22,178 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 11:50:22,178 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 11:50:22,178 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 11:50:22,178 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 11:50:22,178 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 11:50:22,178 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 11:50:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 11:50:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 11:50:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 11:50:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 11:50:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 11:50:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 11:50:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 11:50:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 11:50:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 11:50:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 11:50:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 11:50:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 11:50:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 11:50:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 11:50:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 11:50:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 11:50:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 11:50:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 11:50:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 11:50:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 11:50:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 11:50:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 11:50:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 11:50:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 11:50:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 11:50:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 11:50:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 11:50:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 11:50:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 11:50:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 11:50:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 11:50:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 11:50:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 11:50:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 11:50:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 11:50:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 11:50:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 11:50:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 11:50:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 11:50:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 11:50:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 11:50:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 11:50:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 11:50:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 11:50:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 11:50:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 11:50:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 11:50:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 11:50:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 11:50:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 11:50:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 11:50:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 11:50:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 11:50:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 11:50:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 11:50:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-11-28 11:50:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:50:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:50:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:50:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 11:50:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 11:50:22,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:50:22,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:50:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:50:22,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:50:23,084 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:50:23,084 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-28 11:50:23,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:50:23 BoogieIcfgContainer [2018-11-28 11:50:23,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:50:23,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:50:23,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:50:23,089 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:50:23,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:50:21" (1/3) ... [2018-11-28 11:50:23,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128e1fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:50:23, skipping insertion in model container [2018-11-28 11:50:23,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:22" (2/3) ... [2018-11-28 11:50:23,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128e1fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:50:23, skipping insertion in model container [2018-11-28 11:50:23,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:50:23" (3/3) ... [2018-11-28 11:50:23,093 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-11-28 11:50:23,104 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:50:23,114 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-11-28 11:50:23,131 INFO L257 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2018-11-28 11:50:23,159 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:50:23,160 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:50:23,160 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 11:50:23,160 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:50:23,161 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:50:23,161 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:50:23,161 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:50:23,165 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:50:23,165 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:50:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-11-28 11:50:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 11:50:23,196 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:23,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:23,199 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2018-11-28 11:50:23,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:23,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1038621538, now seen corresponding path program 1 times [2018-11-28 11:50:23,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:23,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:23,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:23,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:23,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:23,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:23,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:50:23,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 11:50:23,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 11:50:23,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:50:23,398 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-11-28 11:50:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:23,432 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-11-28 11:50:23,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 11:50:23,433 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-28 11:50:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:23,446 INFO L225 Difference]: With dead ends: 76 [2018-11-28 11:50:23,446 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 11:50:23,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:50:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 11:50:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-28 11:50:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 11:50:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-28 11:50:23,507 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 10 [2018-11-28 11:50:23,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:23,508 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-28 11:50:23,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 11:50:23,508 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-28 11:50:23,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 11:50:23,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:23,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:23,509 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2018-11-28 11:50:23,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:23,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2132532259, now seen corresponding path program 1 times [2018-11-28 11:50:23,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:23,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:23,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:23,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:23,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:50:23,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:50:23,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:50:23,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:50:23,657 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 4 states. [2018-11-28 11:50:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:24,045 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-11-28 11:50:24,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:50:24,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 11:50:24,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:24,048 INFO L225 Difference]: With dead ends: 85 [2018-11-28 11:50:24,049 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 11:50:24,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:50:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 11:50:24,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2018-11-28 11:50:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 11:50:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2018-11-28 11:50:24,060 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 11 [2018-11-28 11:50:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:24,060 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2018-11-28 11:50:24,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:50:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-28 11:50:24,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 11:50:24,062 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:24,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:24,062 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2018-11-28 11:50:24,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:24,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2132532258, now seen corresponding path program 1 times [2018-11-28 11:50:24,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:24,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:24,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:24,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:24,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:24,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:24,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:50:24,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:50:24,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:50:24,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:50:24,150 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 4 states. [2018-11-28 11:50:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:24,868 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-11-28 11:50:24,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:50:24,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 11:50:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:24,871 INFO L225 Difference]: With dead ends: 93 [2018-11-28 11:50:24,872 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 11:50:24,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:50:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 11:50:24,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-11-28 11:50:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 11:50:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-11-28 11:50:24,886 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 11 [2018-11-28 11:50:24,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:24,886 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-11-28 11:50:24,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:50:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-11-28 11:50:24,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 11:50:24,888 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:24,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:24,889 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2018-11-28 11:50:24,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:24,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1219409795, now seen corresponding path program 1 times [2018-11-28 11:50:24,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:24,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:24,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:24,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:24,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:25,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:25,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:50:25,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:50:25,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:50:25,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:50:25,074 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 5 states. [2018-11-28 11:50:25,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:25,399 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2018-11-28 11:50:25,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:50:25,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 11:50:25,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:25,402 INFO L225 Difference]: With dead ends: 122 [2018-11-28 11:50:25,402 INFO L226 Difference]: Without dead ends: 119 [2018-11-28 11:50:25,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:50:25,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-28 11:50:25,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 106. [2018-11-28 11:50:25,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-28 11:50:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2018-11-28 11:50:25,413 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 20 [2018-11-28 11:50:25,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:25,413 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2018-11-28 11:50:25,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:50:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2018-11-28 11:50:25,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 11:50:25,415 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:25,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:25,415 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2018-11-28 11:50:25,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:25,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1219362099, now seen corresponding path program 1 times [2018-11-28 11:50:25,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:25,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:25,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:25,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:25,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:25,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:25,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:50:25,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:50:25,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:50:25,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:50:25,513 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 5 states. [2018-11-28 11:50:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:25,735 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2018-11-28 11:50:25,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:50:25,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 11:50:25,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:25,739 INFO L225 Difference]: With dead ends: 116 [2018-11-28 11:50:25,739 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 11:50:25,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:50:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 11:50:25,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2018-11-28 11:50:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-28 11:50:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2018-11-28 11:50:25,748 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 20 [2018-11-28 11:50:25,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:25,748 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2018-11-28 11:50:25,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:50:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2018-11-28 11:50:25,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 11:50:25,749 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:25,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:25,750 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2018-11-28 11:50:25,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:25,750 INFO L82 PathProgramCache]: Analyzing trace with hash 48910251, now seen corresponding path program 1 times [2018-11-28 11:50:25,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:25,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:25,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:25,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:25,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:25,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:25,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:50:25,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:50:25,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:50:25,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:50:25,801 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 3 states. [2018-11-28 11:50:25,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:25,832 INFO L93 Difference]: Finished difference Result 159 states and 181 transitions. [2018-11-28 11:50:25,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:50:25,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 11:50:25,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:25,838 INFO L225 Difference]: With dead ends: 159 [2018-11-28 11:50:25,838 INFO L226 Difference]: Without dead ends: 159 [2018-11-28 11:50:25,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:50:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-28 11:50:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 120. [2018-11-28 11:50:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-28 11:50:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2018-11-28 11:50:25,851 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 20 [2018-11-28 11:50:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:25,852 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2018-11-28 11:50:25,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:50:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2018-11-28 11:50:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 11:50:25,854 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:25,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:25,855 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2018-11-28 11:50:25,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:25,855 INFO L82 PathProgramCache]: Analyzing trace with hash -246914379, now seen corresponding path program 1 times [2018-11-28 11:50:25,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:25,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:25,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:25,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:25,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:25,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:25,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:50:25,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:50:25,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:50:25,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:50:25,975 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand 6 states. [2018-11-28 11:50:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:26,381 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2018-11-28 11:50:26,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:50:26,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-28 11:50:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:26,384 INFO L225 Difference]: With dead ends: 127 [2018-11-28 11:50:26,384 INFO L226 Difference]: Without dead ends: 127 [2018-11-28 11:50:26,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:50:26,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-28 11:50:26,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2018-11-28 11:50:26,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 11:50:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2018-11-28 11:50:26,392 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 20 [2018-11-28 11:50:26,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:26,393 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2018-11-28 11:50:26,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:50:26,393 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2018-11-28 11:50:26,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 11:50:26,394 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:26,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:26,394 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2018-11-28 11:50:26,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:26,395 INFO L82 PathProgramCache]: Analyzing trace with hash 854480748, now seen corresponding path program 1 times [2018-11-28 11:50:26,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:26,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:26,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:26,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:26,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:26,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:26,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:50:26,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:50:26,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:50:26,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:50:26,478 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 6 states. [2018-11-28 11:50:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:26,763 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-11-28 11:50:26,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:50:26,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 11:50:26,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:26,766 INFO L225 Difference]: With dead ends: 108 [2018-11-28 11:50:26,766 INFO L226 Difference]: Without dead ends: 108 [2018-11-28 11:50:26,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:50:26,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-28 11:50:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2018-11-28 11:50:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-28 11:50:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2018-11-28 11:50:26,773 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 21 [2018-11-28 11:50:26,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:26,774 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2018-11-28 11:50:26,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:50:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-11-28 11:50:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 11:50:26,775 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:26,775 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:26,776 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2018-11-28 11:50:26,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:26,776 INFO L82 PathProgramCache]: Analyzing trace with hash -810428214, now seen corresponding path program 1 times [2018-11-28 11:50:26,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:26,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:26,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:26,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:26,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:26,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:26,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:26,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:50:26,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:50:26,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:50:26,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:50:26,891 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2018-11-28 11:50:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:27,142 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2018-11-28 11:50:27,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:50:27,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 11:50:27,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:27,145 INFO L225 Difference]: With dead ends: 103 [2018-11-28 11:50:27,145 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 11:50:27,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:50:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 11:50:27,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-11-28 11:50:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 11:50:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-11-28 11:50:27,153 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 21 [2018-11-28 11:50:27,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:27,154 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-11-28 11:50:27,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:50:27,154 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-11-28 11:50:27,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 11:50:27,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:27,156 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:27,157 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2018-11-28 11:50:27,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:27,157 INFO L82 PathProgramCache]: Analyzing trace with hash -810428213, now seen corresponding path program 1 times [2018-11-28 11:50:27,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:27,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:27,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:27,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:27,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:27,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:27,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:50:27,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:50:27,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:50:27,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:50:27,395 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 6 states. [2018-11-28 11:50:27,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:27,740 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-11-28 11:50:27,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:50:27,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 11:50:27,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:27,743 INFO L225 Difference]: With dead ends: 112 [2018-11-28 11:50:27,743 INFO L226 Difference]: Without dead ends: 112 [2018-11-28 11:50:27,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:50:27,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-28 11:50:27,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 86. [2018-11-28 11:50:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-28 11:50:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-11-28 11:50:27,750 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 21 [2018-11-28 11:50:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:27,751 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-11-28 11:50:27,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:50:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-11-28 11:50:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 11:50:27,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:27,752 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] [2018-11-28 11:50:27,752 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2018-11-28 11:50:27,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:27,753 INFO L82 PathProgramCache]: Analyzing trace with hash 719099552, now seen corresponding path program 1 times [2018-11-28 11:50:27,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:27,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:27,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:27,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:27,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:27,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:27,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:50:27,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:50:27,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:50:27,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:50:27,871 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 7 states. [2018-11-28 11:50:28,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:28,136 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-11-28 11:50:28,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:50:28,138 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-28 11:50:28,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:28,139 INFO L225 Difference]: With dead ends: 105 [2018-11-28 11:50:28,139 INFO L226 Difference]: Without dead ends: 98 [2018-11-28 11:50:28,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:50:28,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-28 11:50:28,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2018-11-28 11:50:28,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 11:50:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-11-28 11:50:28,143 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 22 [2018-11-28 11:50:28,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:28,143 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-11-28 11:50:28,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:50:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-11-28 11:50:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:50:28,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:28,144 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:28,145 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2018-11-28 11:50:28,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:28,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1968452048, now seen corresponding path program 1 times [2018-11-28 11:50:28,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:28,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:28,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:28,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:28,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:28,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:50:28,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:50:28,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:28,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:50:28,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:50:28,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:28,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:28,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:50:29,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:50:29,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:50:29,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-11-28 11:50:29,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:29,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:29,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:50:29,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-11-28 11:50:29,464 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-28 11:50:29,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 11:50:29,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 11:50:29,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 11:50:29,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:29,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 11:50:29,563 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,648 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-11-28 11:50:29,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 11:50:29,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-28 11:50:29,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-11-28 11:50:29,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 11:50:29,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:50:29,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:29,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-11-28 11:50:29,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 11:50:29,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:50:29,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 11:50:29,950 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:29,958 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-11-28 11:50:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:30,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:50:30,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-11-28 11:50:30,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 11:50:30,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 11:50:30,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-11-28 11:50:30,009 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 21 states. [2018-11-28 11:50:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:31,692 INFO L93 Difference]: Finished difference Result 179 states and 200 transitions. [2018-11-28 11:50:31,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 11:50:31,693 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-11-28 11:50:31,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:31,697 INFO L225 Difference]: With dead ends: 179 [2018-11-28 11:50:31,697 INFO L226 Difference]: Without dead ends: 179 [2018-11-28 11:50:31,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2018-11-28 11:50:31,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-28 11:50:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 96. [2018-11-28 11:50:31,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 11:50:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2018-11-28 11:50:31,704 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 30 [2018-11-28 11:50:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:31,704 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2018-11-28 11:50:31,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 11:50:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-11-28 11:50:31,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:50:31,706 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:31,707 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:31,707 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2018-11-28 11:50:31,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:31,707 INFO L82 PathProgramCache]: Analyzing trace with hash -995956632, now seen corresponding path program 1 times [2018-11-28 11:50:31,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:31,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:31,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:31,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:31,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:32,250 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-11-28 11:50:32,557 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-11-28 11:50:32,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:32,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:50:32,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:50:32,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:32,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:50:32,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:50:32,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:32,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:32,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:50:32,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:50:32,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:50:32,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:32,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:32,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:32,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-28 11:50:32,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:32,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:32,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:50:32,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:32,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:32,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-11-28 11:50:32,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 11:50:33,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:33,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 11:50:33,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:33,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:33,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 11:50:33,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 11:50:33,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:33,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:33,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:33,047 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2018-11-28 11:50:33,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 11:50:33,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-28 11:50:33,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:33,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:33,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:33,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-11-28 11:50:33,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 11:50:33,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:50:33,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:33,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:33,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:33,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-11-28 11:50:33,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 11:50:33,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 11:50:33,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:33,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:50:33,263 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:33,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:33,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:33,282 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-11-28 11:50:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:33,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:50:33,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-28 11:50:33,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 11:50:33,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 11:50:33,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-11-28 11:50:33,319 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 21 states. [2018-11-28 11:50:33,730 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 11:50:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:34,638 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-11-28 11:50:34,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 11:50:34,640 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-11-28 11:50:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:34,641 INFO L225 Difference]: With dead ends: 133 [2018-11-28 11:50:34,641 INFO L226 Difference]: Without dead ends: 126 [2018-11-28 11:50:34,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 11:50:34,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-28 11:50:34,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2018-11-28 11:50:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-28 11:50:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2018-11-28 11:50:34,648 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 30 [2018-11-28 11:50:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:34,650 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2018-11-28 11:50:34,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 11:50:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2018-11-28 11:50:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 11:50:34,651 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:34,651 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:34,657 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2018-11-28 11:50:34,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:34,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1031908765, now seen corresponding path program 1 times [2018-11-28 11:50:34,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:34,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:34,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:34,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:34,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:35,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:35,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:50:35,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:50:35,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:35,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:50:35,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:50:35,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:50:35,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:50:35,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:50:35,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-11-28 11:50:35,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:35,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:35,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:50:35,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-11-28 11:50:35,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 11:50:35,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 11:50:35,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 11:50:35,607 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:35,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 11:50:35,609 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,614 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,629 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2018-11-28 11:50:35,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 11:50:35,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-28 11:50:35,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2018-11-28 11:50:35,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 11:50:35,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:50:35,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-28 11:50:35,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:35,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:35,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:50:35,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-11-28 11:50:35,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 11:50:35,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 11:50:35,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-28 11:50:35,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:35,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 11:50:35,909 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,930 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2018-11-28 11:50:35,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 11:50:35,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-28 11:50:35,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:35,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:35,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26 [2018-11-28 11:50:36,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-11-28 11:50:36,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-28 11:50:36,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:36,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:36,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-11-28 11:50:36,347 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 11:50:36,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:50:36,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-11-28 11:50:36,433 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:37, output treesize:56 [2018-11-28 11:50:36,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 11:50:36,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:50:36,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:36,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 11:50:36,630 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:36,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:36,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:36,640 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-28 11:50:36,664 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:36,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:50:36,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2018-11-28 11:50:36,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-28 11:50:36,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-28 11:50:36,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2018-11-28 11:50:36,690 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 31 states. [2018-11-28 11:50:38,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:38,373 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2018-11-28 11:50:38,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-28 11:50:38,375 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-11-28 11:50:38,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:38,377 INFO L225 Difference]: With dead ends: 92 [2018-11-28 11:50:38,377 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 11:50:38,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=386, Invalid=2064, Unknown=0, NotChecked=0, Total=2450 [2018-11-28 11:50:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 11:50:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-11-28 11:50:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 11:50:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-11-28 11:50:38,382 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 40 [2018-11-28 11:50:38,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:38,382 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-11-28 11:50:38,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-28 11:50:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-11-28 11:50:38,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 11:50:38,384 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:38,384 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:38,384 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2018-11-28 11:50:38,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:38,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2004404181, now seen corresponding path program 1 times [2018-11-28 11:50:38,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:38,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:38,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:38,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:38,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:38,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:50:38,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:50:38,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:38,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:50:38,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:50:38,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:38,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:38,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:50:39,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:50:39,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:50:39,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-28 11:50:39,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:39,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:39,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 11:50:39,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2018-11-28 11:50:39,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 11:50:39,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:39,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 11:50:39,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 11:50:39,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 11:50:39,306 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,309 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,330 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:46 [2018-11-28 11:50:39,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-28 11:50:39,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-11-28 11:50:39,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:28 [2018-11-28 11:50:39,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 11:50:39,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:50:39,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-11-28 11:50:39,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:39,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:39,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:39,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 11:50:39,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2018-11-28 11:50:39,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 11:50:39,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 11:50:39,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-28 11:50:39,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:39,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 11:50:39,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,892 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,911 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:45 [2018-11-28 11:50:39,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-28 11:50:39,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-11-28 11:50:39,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:39,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:39,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:33 [2018-11-28 11:50:40,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-11-28 11:50:40,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:50:40,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:40,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:40,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 11:50:40,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-11-28 11:50:40,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-11-28 11:50:40,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:50:40,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:40,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:50:40,353 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:40,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 11:50:40,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:40,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:40,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:40,373 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:47, output treesize:3 [2018-11-28 11:50:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:50:40,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:50:40,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-11-28 11:50:40,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-28 11:50:40,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-28 11:50:40,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2018-11-28 11:50:40,415 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 30 states. [2018-11-28 11:50:42,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:42,788 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-11-28 11:50:42,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 11:50:42,790 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2018-11-28 11:50:42,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:42,791 INFO L225 Difference]: With dead ends: 79 [2018-11-28 11:50:42,791 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 11:50:42,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=558, Invalid=2748, Unknown=0, NotChecked=0, Total=3306 [2018-11-28 11:50:42,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 11:50:42,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 11:50:42,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 11:50:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 11:50:42,795 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-11-28 11:50:42,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:42,795 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:50:42,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-28 11:50:42,795 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:50:42,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 11:50:42,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:50:42 BoogieIcfgContainer [2018-11-28 11:50:42,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:50:42,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:50:42,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:50:42,804 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:50:42,804 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:50:23" (3/4) ... [2018-11-28 11:50:42,811 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 11:50:42,817 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 11:50:42,817 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-11-28 11:50:42,818 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 11:50:42,824 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 11:50:42,824 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 11:50:42,824 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 11:50:42,882 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 11:50:42,882 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:50:42,883 INFO L168 Benchmark]: Toolchain (without parser) took 21551.34 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 948.7 MB in the beginning and 871.1 MB in the end (delta: 77.6 MB). Peak memory consumption was 387.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:50:42,885 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:50:42,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:50:42,886 INFO L168 Benchmark]: Boogie Preprocessor took 73.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:50:42,886 INFO L168 Benchmark]: RCFGBuilder took 984.38 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: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:50:42,886 INFO L168 Benchmark]: TraceAbstraction took 19717.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 880.5 MB in the end (delta: 189.5 MB). Peak memory consumption was 370.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:50:42,889 INFO L168 Benchmark]: Witness Printer took 78.51 ms. Allocated memory is still 1.3 GB. Free memory was 880.5 MB in the beginning and 871.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:50:42,893 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 691.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 984.38 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: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19717.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 880.5 MB in the end (delta: 189.5 MB). Peak memory consumption was 370.4 MB. Max. memory is 11.5 GB. * Witness Printer took 78.51 ms. Allocated memory is still 1.3 GB. Free memory was 880.5 MB in the beginning and 871.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 645]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 666]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 645]: 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: 643]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 643]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: 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: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: 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: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 27 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 78 locations, 27 error locations. SAFE Result, 19.6s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 707 SDtfs, 1525 SDslu, 2490 SDs, 0 SdLazy, 3079 SolverSat, 432 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 117 SyntacticMatches, 6 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2155 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 284 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 458 ConstructedInterpolants, 22 QuantifiedInterpolants, 141358 SizeOfPredicates, 65 NumberOfNonLiveVariables, 646 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 11/67 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...