./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31de2fb67e84e52bb7705ac8720e6b139fef2d91 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 19:05:19,284 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 19:05:19,287 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 19:05:19,303 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 19:05:19,305 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 19:05:19,306 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 19:05:19,308 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 19:05:19,310 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 19:05:19,313 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 19:05:19,314 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 19:05:19,319 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 19:05:19,319 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 19:05:19,321 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 19:05:19,322 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 19:05:19,328 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 19:05:19,332 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 19:05:19,333 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 19:05:19,337 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 19:05:19,342 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 19:05:19,343 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 19:05:19,344 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 19:05:19,345 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 19:05:19,351 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 19:05:19,351 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 19:05:19,351 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 19:05:19,352 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 19:05:19,353 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 19:05:19,356 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 19:05:19,357 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 19:05:19,358 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 19:05:19,358 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 19:05:19,361 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 19:05:19,361 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 19:05:19,361 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 19:05:19,364 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 19:05:19,364 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 19:05:19,365 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 19:05:19,397 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 19:05:19,397 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 19:05:19,399 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 19:05:19,399 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 19:05:19,400 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 19:05:19,400 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 19:05:19,400 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 19:05:19,400 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 19:05:19,400 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 19:05:19,400 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 19:05:19,402 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 19:05:19,402 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 19:05:19,402 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 19:05:19,402 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 19:05:19,402 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 19:05:19,403 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 19:05:19,403 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 19:05:19,403 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 19:05:19,403 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 19:05:19,403 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 19:05:19,404 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 19:05:19,405 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 19:05:19,405 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 19:05:19,405 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 19:05:19,406 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 19:05:19,406 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 19:05:19,406 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2019-01-01 19:05:19,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 19:05:19,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 19:05:19,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 19:05:19,501 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 19:05:19,502 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 19:05:19,503 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2019-01-01 19:05:19,561 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ffcf8428/c7a2d316501d4c5881cb44127e344288/FLAGe7c5f0f0f [2019-01-01 19:05:20,150 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 19:05:20,151 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2019-01-01 19:05:20,166 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ffcf8428/c7a2d316501d4c5881cb44127e344288/FLAGe7c5f0f0f [2019-01-01 19:05:20,425 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ffcf8428/c7a2d316501d4c5881cb44127e344288 [2019-01-01 19:05:20,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 19:05:20,429 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 19:05:20,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 19:05:20,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 19:05:20,434 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 19:05:20,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:05:20" (1/1) ... [2019-01-01 19:05:20,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f922b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:20, skipping insertion in model container [2019-01-01 19:05:20,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:05:20" (1/1) ... [2019-01-01 19:05:20,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 19:05:20,507 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 19:05:20,854 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:05:20,869 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 19:05:21,033 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:05:21,108 INFO L195 MainTranslator]: Completed translation [2019-01-01 19:05:21,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:21 WrapperNode [2019-01-01 19:05:21,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 19:05:21,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 19:05:21,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 19:05:21,110 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 19:05:21,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:21" (1/1) ... [2019-01-01 19:05:21,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:21" (1/1) ... [2019-01-01 19:05:21,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:21" (1/1) ... [2019-01-01 19:05:21,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:21" (1/1) ... [2019-01-01 19:05:21,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:21" (1/1) ... [2019-01-01 19:05:21,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:21" (1/1) ... [2019-01-01 19:05:21,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:21" (1/1) ... [2019-01-01 19:05:21,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 19:05:21,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 19:05:21,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 19:05:21,185 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 19:05:21,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 19:05:21,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 19:05:21,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 19:05:21,259 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 19:05:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 19:05:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 19:05:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 19:05:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 19:05:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 19:05:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 19:05:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 19:05:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 19:05:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 19:05:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 19:05:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 19:05:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 19:05:21,262 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 19:05:21,262 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 19:05:21,262 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 19:05:21,262 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 19:05:21,262 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 19:05:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 19:05:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 19:05:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 19:05:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 19:05:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 19:05:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 19:05:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 19:05:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 19:05:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 19:05:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 19:05:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 19:05:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 19:05:21,265 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 19:05:21,265 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 19:05:21,265 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 19:05:21,265 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 19:05:21,265 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 19:05:21,265 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 19:05:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 19:05:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 19:05:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 19:05:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 19:05:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 19:05:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 19:05:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 19:05:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 19:05:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 19:05:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 19:05:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 19:05:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 19:05:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 19:05:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 19:05:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 19:05:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 19:05:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 19:05:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 19:05:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 19:05:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 19:05:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 19:05:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 19:05:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 19:05:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-01 19:05:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 19:05:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 19:05:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-01 19:05:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 19:05:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 19:05:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-01 19:05:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 19:05:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 19:05:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 19:05:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 19:05:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 19:05:21,271 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 19:05:21,271 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 19:05:21,271 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 19:05:21,271 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 19:05:21,271 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 19:05:21,271 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 19:05:21,271 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 19:05:21,271 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 19:05:21,274 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 19:05:21,275 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 19:05:21,275 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 19:05:21,275 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 19:05:21,275 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 19:05:21,275 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 19:05:21,275 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 19:05:21,275 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 19:05:21,275 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 19:05:21,275 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 19:05:21,276 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 19:05:21,276 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 19:05:21,276 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 19:05:21,276 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 19:05:21,276 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 19:05:21,276 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 19:05:21,276 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 19:05:21,276 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 19:05:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 19:05:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 19:05:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 19:05:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 19:05:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 19:05:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 19:05:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 19:05:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 19:05:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 19:05:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 19:05:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 19:05:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 19:05:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 19:05:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 19:05:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 19:05:21,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 19:05:22,564 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 19:05:22,564 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2019-01-01 19:05:22,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:05:22 BoogieIcfgContainer [2019-01-01 19:05:22,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 19:05:22,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 19:05:22,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 19:05:22,570 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 19:05:22,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 07:05:20" (1/3) ... [2019-01-01 19:05:22,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556013e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:05:22, skipping insertion in model container [2019-01-01 19:05:22,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:21" (2/3) ... [2019-01-01 19:05:22,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556013e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:05:22, skipping insertion in model container [2019-01-01 19:05:22,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:05:22" (3/3) ... [2019-01-01 19:05:22,573 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2019-01-01 19:05:22,583 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 19:05:22,594 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2019-01-01 19:05:22,615 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2019-01-01 19:05:22,648 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 19:05:22,649 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 19:05:22,649 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 19:05:22,649 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 19:05:22,649 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 19:05:22,649 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 19:05:22,650 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 19:05:22,650 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 19:05:22,650 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 19:05:22,683 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states. [2019-01-01 19:05:22,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 19:05:22,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:22,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:22,701 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:22,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:22,708 INFO L82 PathProgramCache]: Analyzing trace with hash -928996123, now seen corresponding path program 1 times [2019-01-01 19:05:22,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:22,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:22,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:22,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:22,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:22,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:22,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:22,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:05:22,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:05:22,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:05:22,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:05:22,945 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 3 states. [2019-01-01 19:05:23,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:23,644 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2019-01-01 19:05:23,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:05:23,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-01 19:05:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:23,658 INFO L225 Difference]: With dead ends: 172 [2019-01-01 19:05:23,658 INFO L226 Difference]: Without dead ends: 168 [2019-01-01 19:05:23,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:05:23,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-01 19:05:23,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 163. [2019-01-01 19:05:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-01 19:05:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2019-01-01 19:05:23,713 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 176 transitions. Word has length 7 [2019-01-01 19:05:23,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:23,713 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 176 transitions. [2019-01-01 19:05:23,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:05:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 176 transitions. [2019-01-01 19:05:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 19:05:23,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:23,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:23,714 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:23,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:23,715 INFO L82 PathProgramCache]: Analyzing trace with hash -928996122, now seen corresponding path program 1 times [2019-01-01 19:05:23,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:23,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:23,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:23,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:23,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:23,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:23,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:23,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:05:23,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:05:23,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:05:23,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:05:23,780 INFO L87 Difference]: Start difference. First operand 163 states and 176 transitions. Second operand 3 states. [2019-01-01 19:05:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:24,212 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2019-01-01 19:05:24,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:05:24,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-01 19:05:24,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:24,216 INFO L225 Difference]: With dead ends: 187 [2019-01-01 19:05:24,216 INFO L226 Difference]: Without dead ends: 187 [2019-01-01 19:05:24,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:05:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-01 19:05:24,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 173. [2019-01-01 19:05:24,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-01 19:05:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 194 transitions. [2019-01-01 19:05:24,234 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 194 transitions. Word has length 7 [2019-01-01 19:05:24,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:24,234 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 194 transitions. [2019-01-01 19:05:24,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:05:24,234 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 194 transitions. [2019-01-01 19:05:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 19:05:24,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:24,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:24,236 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:24,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:24,236 INFO L82 PathProgramCache]: Analyzing trace with hash -694003629, now seen corresponding path program 1 times [2019-01-01 19:05:24,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:24,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:24,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:24,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:24,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:24,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:24,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 19:05:24,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:05:24,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:05:24,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:05:24,354 INFO L87 Difference]: Start difference. First operand 173 states and 194 transitions. Second operand 5 states. [2019-01-01 19:05:25,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:25,073 INFO L93 Difference]: Finished difference Result 297 states and 327 transitions. [2019-01-01 19:05:25,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:05:25,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-01 19:05:25,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:25,078 INFO L225 Difference]: With dead ends: 297 [2019-01-01 19:05:25,079 INFO L226 Difference]: Without dead ends: 297 [2019-01-01 19:05:25,079 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 [2019-01-01 19:05:25,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-01-01 19:05:25,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 172. [2019-01-01 19:05:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-01 19:05:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions. [2019-01-01 19:05:25,094 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 14 [2019-01-01 19:05:25,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:25,094 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions. [2019-01-01 19:05:25,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:05:25,095 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions. [2019-01-01 19:05:25,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 19:05:25,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:25,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:25,096 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:25,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:25,096 INFO L82 PathProgramCache]: Analyzing trace with hash -694003628, now seen corresponding path program 1 times [2019-01-01 19:05:25,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:25,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:25,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:25,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:25,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:25,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:25,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 19:05:25,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:05:25,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:05:25,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:05:25,237 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand 5 states. [2019-01-01 19:05:25,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:25,883 INFO L93 Difference]: Finished difference Result 321 states and 362 transitions. [2019-01-01 19:05:25,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:05:25,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-01 19:05:25,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:25,887 INFO L225 Difference]: With dead ends: 321 [2019-01-01 19:05:25,888 INFO L226 Difference]: Without dead ends: 321 [2019-01-01 19:05:25,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:05:25,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-01-01 19:05:25,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 171. [2019-01-01 19:05:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-01 19:05:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2019-01-01 19:05:25,901 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 14 [2019-01-01 19:05:25,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:25,902 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2019-01-01 19:05:25,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:05:25,902 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2019-01-01 19:05:25,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 19:05:25,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:25,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:25,903 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:25,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:25,903 INFO L82 PathProgramCache]: Analyzing trace with hash 910461370, now seen corresponding path program 1 times [2019-01-01 19:05:25,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:25,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:25,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:25,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:25,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:26,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:26,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 19:05:26,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 19:05:26,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 19:05:26,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:05:26,091 INFO L87 Difference]: Start difference. First operand 171 states and 192 transitions. Second operand 8 states. [2019-01-01 19:05:26,279 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 19:05:27,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:27,567 INFO L93 Difference]: Finished difference Result 299 states and 327 transitions. [2019-01-01 19:05:27,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:05:27,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-01-01 19:05:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:27,570 INFO L225 Difference]: With dead ends: 299 [2019-01-01 19:05:27,571 INFO L226 Difference]: Without dead ends: 299 [2019-01-01 19:05:27,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:05:27,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-01-01 19:05:27,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 170. [2019-01-01 19:05:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-01-01 19:05:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2019-01-01 19:05:27,583 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 191 transitions. Word has length 17 [2019-01-01 19:05:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:27,583 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 191 transitions. [2019-01-01 19:05:27,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 19:05:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 191 transitions. [2019-01-01 19:05:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 19:05:27,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:27,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:27,584 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:27,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:27,588 INFO L82 PathProgramCache]: Analyzing trace with hash 910461371, now seen corresponding path program 1 times [2019-01-01 19:05:27,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:27,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:27,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:27,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:27,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:27,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:27,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 19:05:27,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 19:05:27,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 19:05:27,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:05:27,815 INFO L87 Difference]: Start difference. First operand 170 states and 191 transitions. Second operand 8 states. [2019-01-01 19:05:29,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:29,737 INFO L93 Difference]: Finished difference Result 300 states and 328 transitions. [2019-01-01 19:05:29,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 19:05:29,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-01-01 19:05:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:29,740 INFO L225 Difference]: With dead ends: 300 [2019-01-01 19:05:29,741 INFO L226 Difference]: Without dead ends: 300 [2019-01-01 19:05:29,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:05:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-01 19:05:29,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 169. [2019-01-01 19:05:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-01 19:05:29,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2019-01-01 19:05:29,751 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 17 [2019-01-01 19:05:29,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:29,751 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2019-01-01 19:05:29,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 19:05:29,751 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2019-01-01 19:05:29,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 19:05:29,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:29,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] [2019-01-01 19:05:29,754 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:29,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:29,755 INFO L82 PathProgramCache]: Analyzing trace with hash -831607406, now seen corresponding path program 1 times [2019-01-01 19:05:29,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:29,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:29,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:29,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:29,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:29,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:29,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:05:29,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:05:29,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:05:29,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:05:29,875 INFO L87 Difference]: Start difference. First operand 169 states and 190 transitions. Second operand 5 states. [2019-01-01 19:05:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:30,273 INFO L93 Difference]: Finished difference Result 252 states and 279 transitions. [2019-01-01 19:05:30,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:05:30,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-01 19:05:30,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:30,277 INFO L225 Difference]: With dead ends: 252 [2019-01-01 19:05:30,277 INFO L226 Difference]: Without dead ends: 252 [2019-01-01 19:05:30,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:05:30,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-01-01 19:05:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 172. [2019-01-01 19:05:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-01 19:05:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions. [2019-01-01 19:05:30,285 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 21 [2019-01-01 19:05:30,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:30,286 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions. [2019-01-01 19:05:30,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:05:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions. [2019-01-01 19:05:30,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 19:05:30,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:30,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:30,288 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:30,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:30,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1311532823, now seen corresponding path program 1 times [2019-01-01 19:05:30,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:30,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:30,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:30,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:30,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:30,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:30,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 19:05:30,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 19:05:30,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 19:05:30,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 19:05:30,372 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand 4 states. [2019-01-01 19:05:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:30,606 INFO L93 Difference]: Finished difference Result 174 states and 192 transitions. [2019-01-01 19:05:30,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 19:05:30,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-01-01 19:05:30,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:30,608 INFO L225 Difference]: With dead ends: 174 [2019-01-01 19:05:30,608 INFO L226 Difference]: Without dead ends: 174 [2019-01-01 19:05:30,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:05:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-01 19:05:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 163. [2019-01-01 19:05:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-01 19:05:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2019-01-01 19:05:30,615 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 184 transitions. Word has length 23 [2019-01-01 19:05:30,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:30,615 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 184 transitions. [2019-01-01 19:05:30,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 19:05:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 184 transitions. [2019-01-01 19:05:30,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 19:05:30,618 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:30,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:30,618 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:30,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1311532824, now seen corresponding path program 1 times [2019-01-01 19:05:30,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:30,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:30,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:30,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:30,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:30,878 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 19:05:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:30,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:30,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 19:05:30,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:05:30,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:05:30,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:05:30,915 INFO L87 Difference]: Start difference. First operand 163 states and 184 transitions. Second operand 7 states. [2019-01-01 19:05:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:31,328 INFO L93 Difference]: Finished difference Result 220 states and 237 transitions. [2019-01-01 19:05:31,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:05:31,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-01 19:05:31,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:31,332 INFO L225 Difference]: With dead ends: 220 [2019-01-01 19:05:31,334 INFO L226 Difference]: Without dead ends: 220 [2019-01-01 19:05:31,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:05:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-01-01 19:05:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 186. [2019-01-01 19:05:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-01 19:05:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 218 transitions. [2019-01-01 19:05:31,341 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 218 transitions. Word has length 23 [2019-01-01 19:05:31,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:31,343 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 218 transitions. [2019-01-01 19:05:31,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:05:31,344 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 218 transitions. [2019-01-01 19:05:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 19:05:31,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:31,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:31,346 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:31,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:31,346 INFO L82 PathProgramCache]: Analyzing trace with hash 556899944, now seen corresponding path program 1 times [2019-01-01 19:05:31,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:31,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:31,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:31,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:31,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:31,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:31,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:05:31,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:05:31,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:05:31,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:05:31,582 INFO L87 Difference]: Start difference. First operand 186 states and 218 transitions. Second operand 6 states. [2019-01-01 19:05:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:31,992 INFO L93 Difference]: Finished difference Result 271 states and 320 transitions. [2019-01-01 19:05:31,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:05:31,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-01 19:05:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:31,996 INFO L225 Difference]: With dead ends: 271 [2019-01-01 19:05:31,996 INFO L226 Difference]: Without dead ends: 271 [2019-01-01 19:05:31,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:05:31,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-01-01 19:05:32,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 185. [2019-01-01 19:05:32,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-01 19:05:32,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 217 transitions. [2019-01-01 19:05:32,004 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 217 transitions. Word has length 26 [2019-01-01 19:05:32,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:32,004 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 217 transitions. [2019-01-01 19:05:32,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:05:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 217 transitions. [2019-01-01 19:05:32,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 19:05:32,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:32,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:32,009 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:32,010 INFO L82 PathProgramCache]: Analyzing trace with hash 556899945, now seen corresponding path program 1 times [2019-01-01 19:05:32,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:32,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:32,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:32,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:32,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:32,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:32,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:32,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:05:32,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:05:32,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:05:32,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:05:32,132 INFO L87 Difference]: Start difference. First operand 185 states and 217 transitions. Second operand 6 states. [2019-01-01 19:05:32,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:32,637 INFO L93 Difference]: Finished difference Result 288 states and 346 transitions. [2019-01-01 19:05:32,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:05:32,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-01 19:05:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:32,642 INFO L225 Difference]: With dead ends: 288 [2019-01-01 19:05:32,642 INFO L226 Difference]: Without dead ends: 288 [2019-01-01 19:05:32,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:05:32,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-01-01 19:05:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 172. [2019-01-01 19:05:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-01 19:05:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 203 transitions. [2019-01-01 19:05:32,648 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 203 transitions. Word has length 26 [2019-01-01 19:05:32,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:32,648 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 203 transitions. [2019-01-01 19:05:32,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:05:32,648 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 203 transitions. [2019-01-01 19:05:32,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 19:05:32,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:32,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:32,650 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:32,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:32,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1620647415, now seen corresponding path program 1 times [2019-01-01 19:05:32,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:32,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:32,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:32,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:32,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:32,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:32,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:05:32,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:05:32,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:05:32,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:05:32,782 INFO L87 Difference]: Start difference. First operand 172 states and 203 transitions. Second operand 5 states. [2019-01-01 19:05:32,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:32,968 INFO L93 Difference]: Finished difference Result 196 states and 212 transitions. [2019-01-01 19:05:32,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:05:32,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-01 19:05:32,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:32,971 INFO L225 Difference]: With dead ends: 196 [2019-01-01 19:05:32,971 INFO L226 Difference]: Without dead ends: 196 [2019-01-01 19:05:32,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:05:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-01 19:05:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 172. [2019-01-01 19:05:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-01 19:05:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 201 transitions. [2019-01-01 19:05:32,977 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 201 transitions. Word has length 29 [2019-01-01 19:05:32,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:32,978 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 201 transitions. [2019-01-01 19:05:32,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:05:32,978 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 201 transitions. [2019-01-01 19:05:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-01 19:05:32,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:32,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:32,979 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:32,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:32,980 INFO L82 PathProgramCache]: Analyzing trace with hash -51857924, now seen corresponding path program 1 times [2019-01-01 19:05:32,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:32,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:32,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:32,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:32,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:33,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:33,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 19:05:33,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 19:05:33,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 19:05:33,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:05:33,125 INFO L87 Difference]: Start difference. First operand 172 states and 201 transitions. Second operand 8 states. [2019-01-01 19:05:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:33,603 INFO L93 Difference]: Finished difference Result 263 states and 300 transitions. [2019-01-01 19:05:33,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:05:33,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-01-01 19:05:33,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:33,606 INFO L225 Difference]: With dead ends: 263 [2019-01-01 19:05:33,606 INFO L226 Difference]: Without dead ends: 263 [2019-01-01 19:05:33,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-01 19:05:33,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-01-01 19:05:33,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 184. [2019-01-01 19:05:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-01-01 19:05:33,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 214 transitions. [2019-01-01 19:05:33,612 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 214 transitions. Word has length 33 [2019-01-01 19:05:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:33,612 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 214 transitions. [2019-01-01 19:05:33,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 19:05:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 214 transitions. [2019-01-01 19:05:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 19:05:33,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:33,616 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, 1, 1, 1, 1, 1] [2019-01-01 19:05:33,616 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:33,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:33,617 INFO L82 PathProgramCache]: Analyzing trace with hash -2064017871, now seen corresponding path program 1 times [2019-01-01 19:05:33,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:33,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:33,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:33,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:33,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:33,897 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-01-01 19:05:34,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:34,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:05:34,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:05:34,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:34,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:05:34,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:05:34,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:05:34,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:05:34,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:05:34,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:05:34,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:05:34,316 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:05:34,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:05:34,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:05:34,330 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2019-01-01 19:05:34,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-01-01 19:05:34,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:05:34,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-01 19:05:34,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:05:34,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:05:34,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-01-01 19:05:34,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:05:34,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-01 19:05:34,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:05:34,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:05:34,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:05:34,520 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-01-01 19:05:34,619 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 24 treesize of output 18 [2019-01-01 19:05:34,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:05:34,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-01 19:05:34,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:05:34,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:05:34,698 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 24 treesize of output 18 [2019-01-01 19:05:34,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:05:34,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-01 19:05:34,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:05:34,711 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:05:34,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:05:34,719 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2019-01-01 19:05:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:34,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:05:34,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2019-01-01 19:05:34,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 19:05:34,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 19:05:34,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:05:34,762 INFO L87 Difference]: Start difference. First operand 184 states and 214 transitions. Second operand 10 states. [2019-01-01 19:05:35,798 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-01 19:05:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:36,412 INFO L93 Difference]: Finished difference Result 303 states and 334 transitions. [2019-01-01 19:05:36,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 19:05:36,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-01-01 19:05:36,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:36,416 INFO L225 Difference]: With dead ends: 303 [2019-01-01 19:05:36,417 INFO L226 Difference]: Without dead ends: 303 [2019-01-01 19:05:36,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-01-01 19:05:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-01 19:05:36,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 212. [2019-01-01 19:05:36,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-01 19:05:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 254 transitions. [2019-01-01 19:05:36,429 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 254 transitions. Word has length 35 [2019-01-01 19:05:36,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:36,429 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 254 transitions. [2019-01-01 19:05:36,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 19:05:36,429 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 254 transitions. [2019-01-01 19:05:36,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 19:05:36,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:36,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:36,433 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:36,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:36,434 INFO L82 PathProgramCache]: Analyzing trace with hash 669806936, now seen corresponding path program 1 times [2019-01-01 19:05:36,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:36,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:36,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:36,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:36,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:36,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:36,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 19:05:36,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:05:36,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:05:36,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:05:36,736 INFO L87 Difference]: Start difference. First operand 212 states and 254 transitions. Second operand 5 states. [2019-01-01 19:05:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:37,323 INFO L93 Difference]: Finished difference Result 314 states and 375 transitions. [2019-01-01 19:05:37,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:05:37,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-01 19:05:37,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:37,326 INFO L225 Difference]: With dead ends: 314 [2019-01-01 19:05:37,326 INFO L226 Difference]: Without dead ends: 314 [2019-01-01 19:05:37,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:05:37,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-01 19:05:37,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 211. [2019-01-01 19:05:37,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-01 19:05:37,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 253 transitions. [2019-01-01 19:05:37,332 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 253 transitions. Word has length 35 [2019-01-01 19:05:37,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:37,332 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 253 transitions. [2019-01-01 19:05:37,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:05:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 253 transitions. [2019-01-01 19:05:37,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 19:05:37,333 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:37,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:37,334 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:37,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:37,334 INFO L82 PathProgramCache]: Analyzing trace with hash 669806937, now seen corresponding path program 1 times [2019-01-01 19:05:37,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:37,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:37,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:37,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:37,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:37,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:37,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 19:05:37,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:05:37,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:05:37,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:05:37,598 INFO L87 Difference]: Start difference. First operand 211 states and 253 transitions. Second operand 5 states. [2019-01-01 19:05:37,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:37,907 INFO L93 Difference]: Finished difference Result 341 states and 410 transitions. [2019-01-01 19:05:37,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:05:37,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-01 19:05:37,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:37,911 INFO L225 Difference]: With dead ends: 341 [2019-01-01 19:05:37,911 INFO L226 Difference]: Without dead ends: 341 [2019-01-01 19:05:37,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:05:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-01-01 19:05:37,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 210. [2019-01-01 19:05:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-01 19:05:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 252 transitions. [2019-01-01 19:05:37,917 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 252 transitions. Word has length 35 [2019-01-01 19:05:37,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:37,918 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 252 transitions. [2019-01-01 19:05:37,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:05:37,918 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 252 transitions. [2019-01-01 19:05:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-01 19:05:37,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:37,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:37,919 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:37,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:37,919 INFO L82 PathProgramCache]: Analyzing trace with hash -283329296, now seen corresponding path program 1 times [2019-01-01 19:05:37,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:37,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:37,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:37,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:37,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:38,347 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2019-01-01 19:05:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:38,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:38,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 19:05:38,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 19:05:38,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 19:05:38,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:05:38,539 INFO L87 Difference]: Start difference. First operand 210 states and 252 transitions. Second operand 11 states. [2019-01-01 19:05:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:39,607 INFO L93 Difference]: Finished difference Result 410 states and 463 transitions. [2019-01-01 19:05:39,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 19:05:39,608 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-01-01 19:05:39,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:39,613 INFO L225 Difference]: With dead ends: 410 [2019-01-01 19:05:39,613 INFO L226 Difference]: Without dead ends: 410 [2019-01-01 19:05:39,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-01-01 19:05:39,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-01-01 19:05:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 213. [2019-01-01 19:05:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-01 19:05:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 254 transitions. [2019-01-01 19:05:39,622 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 254 transitions. Word has length 37 [2019-01-01 19:05:39,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:39,622 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 254 transitions. [2019-01-01 19:05:39,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 19:05:39,622 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 254 transitions. [2019-01-01 19:05:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-01 19:05:39,624 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:39,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:39,625 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:39,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:39,625 INFO L82 PathProgramCache]: Analyzing trace with hash -283329295, now seen corresponding path program 1 times [2019-01-01 19:05:39,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:39,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:39,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:39,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:39,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:39,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:39,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 19:05:39,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 19:05:39,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 19:05:39,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:05:39,934 INFO L87 Difference]: Start difference. First operand 213 states and 254 transitions. Second operand 11 states. [2019-01-01 19:05:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:41,371 INFO L93 Difference]: Finished difference Result 458 states and 512 transitions. [2019-01-01 19:05:41,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 19:05:41,373 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-01-01 19:05:41,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:41,375 INFO L225 Difference]: With dead ends: 458 [2019-01-01 19:05:41,375 INFO L226 Difference]: Without dead ends: 458 [2019-01-01 19:05:41,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-01-01 19:05:41,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-01-01 19:05:41,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 219. [2019-01-01 19:05:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-01-01 19:05:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 259 transitions. [2019-01-01 19:05:41,383 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 259 transitions. Word has length 37 [2019-01-01 19:05:41,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:41,384 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 259 transitions. [2019-01-01 19:05:41,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 19:05:41,384 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 259 transitions. [2019-01-01 19:05:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 19:05:41,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:41,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:41,388 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:41,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:41,388 INFO L82 PathProgramCache]: Analyzing trace with hash -199509631, now seen corresponding path program 1 times [2019-01-01 19:05:41,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:41,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:41,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:41,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:41,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:41,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:41,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 19:05:41,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 19:05:41,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 19:05:41,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:05:41,516 INFO L87 Difference]: Start difference. First operand 219 states and 259 transitions. Second operand 8 states. [2019-01-01 19:05:41,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:41,819 INFO L93 Difference]: Finished difference Result 232 states and 274 transitions. [2019-01-01 19:05:41,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:05:41,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-01-01 19:05:41,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:41,821 INFO L225 Difference]: With dead ends: 232 [2019-01-01 19:05:41,821 INFO L226 Difference]: Without dead ends: 232 [2019-01-01 19:05:41,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:05:41,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-01-01 19:05:41,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 218. [2019-01-01 19:05:41,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-01-01 19:05:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2019-01-01 19:05:41,826 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 258 transitions. Word has length 38 [2019-01-01 19:05:41,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:41,826 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 258 transitions. [2019-01-01 19:05:41,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 19:05:41,826 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 258 transitions. [2019-01-01 19:05:41,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 19:05:41,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:41,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:41,830 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:41,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:41,831 INFO L82 PathProgramCache]: Analyzing trace with hash -199509630, now seen corresponding path program 1 times [2019-01-01 19:05:41,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:41,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:41,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:41,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:41,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:42,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:42,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 19:05:42,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 19:05:42,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 19:05:42,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:05:42,001 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. Second operand 8 states. [2019-01-01 19:05:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:42,533 INFO L93 Difference]: Finished difference Result 231 states and 273 transitions. [2019-01-01 19:05:42,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:05:42,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-01-01 19:05:42,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:42,537 INFO L225 Difference]: With dead ends: 231 [2019-01-01 19:05:42,537 INFO L226 Difference]: Without dead ends: 231 [2019-01-01 19:05:42,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:05:42,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-01-01 19:05:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 217. [2019-01-01 19:05:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-01 19:05:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 257 transitions. [2019-01-01 19:05:42,543 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 257 transitions. Word has length 38 [2019-01-01 19:05:42,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:42,543 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 257 transitions. [2019-01-01 19:05:42,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 19:05:42,543 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 257 transitions. [2019-01-01 19:05:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-01 19:05:42,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:42,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:42,545 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:42,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:42,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1753341337, now seen corresponding path program 1 times [2019-01-01 19:05:42,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:42,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:42,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:42,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:42,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:05:42,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:42,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 19:05:42,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:05:42,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:05:42,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:05:42,754 INFO L87 Difference]: Start difference. First operand 217 states and 257 transitions. Second operand 7 states. [2019-01-01 19:05:43,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:43,019 INFO L93 Difference]: Finished difference Result 233 states and 273 transitions. [2019-01-01 19:05:43,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 19:05:43,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-01-01 19:05:43,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:43,023 INFO L225 Difference]: With dead ends: 233 [2019-01-01 19:05:43,024 INFO L226 Difference]: Without dead ends: 233 [2019-01-01 19:05:43,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:05:43,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-01-01 19:05:43,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 226. [2019-01-01 19:05:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-01 19:05:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 266 transitions. [2019-01-01 19:05:43,030 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 266 transitions. Word has length 41 [2019-01-01 19:05:43,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:43,030 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 266 transitions. [2019-01-01 19:05:43,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:05:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 266 transitions. [2019-01-01 19:05:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-01 19:05:43,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:43,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:43,035 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:43,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:43,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1423920632, now seen corresponding path program 1 times [2019-01-01 19:05:43,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:43,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:43,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:43,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:43,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:05:43,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:43,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:05:43,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:05:43,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:05:43,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:05:43,106 INFO L87 Difference]: Start difference. First operand 226 states and 266 transitions. Second operand 3 states. [2019-01-01 19:05:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:43,157 INFO L93 Difference]: Finished difference Result 233 states and 267 transitions. [2019-01-01 19:05:43,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:05:43,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-01-01 19:05:43,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:43,162 INFO L225 Difference]: With dead ends: 233 [2019-01-01 19:05:43,162 INFO L226 Difference]: Without dead ends: 233 [2019-01-01 19:05:43,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:05:43,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-01-01 19:05:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2019-01-01 19:05:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-01 19:05:43,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 267 transitions. [2019-01-01 19:05:43,169 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 267 transitions. Word has length 42 [2019-01-01 19:05:43,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:43,169 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 267 transitions. [2019-01-01 19:05:43,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:05:43,169 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 267 transitions. [2019-01-01 19:05:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 19:05:43,170 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:43,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:43,170 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:43,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:43,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1372867121, now seen corresponding path program 1 times [2019-01-01 19:05:43,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:43,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:43,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:43,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:43,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:43,426 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-01-01 19:05:43,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:43,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:05:43,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:05:43,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:43,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:05:43,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 19:05:43,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 19:05:43,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:05:43,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:05:43,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 19:05:43,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 19:05:43,901 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:05:43,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:05:43,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:05:43,912 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-01-01 19:05:44,243 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 24 treesize of output 18 [2019-01-01 19:05:44,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:05:44,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:05:44,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2019-01-01 19:05:44,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:05:44,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:05:44,346 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 24 treesize of output 18 [2019-01-01 19:05:44,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:05:44,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:05:44,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2019-01-01 19:05:44,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-01 19:05:44,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:05:44,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:05:44,495 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:18 [2019-01-01 19:05:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:44,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:05:44,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2019-01-01 19:05:44,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 19:05:44,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 19:05:44,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-01-01 19:05:44,601 INFO L87 Difference]: Start difference. First operand 227 states and 267 transitions. Second operand 17 states. [2019-01-01 19:05:44,947 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2019-01-01 19:05:46,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:46,787 INFO L93 Difference]: Finished difference Result 501 states and 544 transitions. [2019-01-01 19:05:46,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-01 19:05:46,788 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2019-01-01 19:05:46,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:46,790 INFO L225 Difference]: With dead ends: 501 [2019-01-01 19:05:46,791 INFO L226 Difference]: Without dead ends: 501 [2019-01-01 19:05:46,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=238, Invalid=1168, Unknown=0, NotChecked=0, Total=1406 [2019-01-01 19:05:46,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-01-01 19:05:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 251. [2019-01-01 19:05:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-01-01 19:05:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 299 transitions. [2019-01-01 19:05:46,800 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 299 transitions. Word has length 45 [2019-01-01 19:05:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:46,800 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 299 transitions. [2019-01-01 19:05:46,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 19:05:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 299 transitions. [2019-01-01 19:05:46,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 19:05:46,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:46,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:46,805 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:46,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:46,805 INFO L82 PathProgramCache]: Analyzing trace with hash -762728307, now seen corresponding path program 1 times [2019-01-01 19:05:46,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:46,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:46,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:46,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:46,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:05:47,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:47,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 19:05:47,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 19:05:47,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 19:05:47,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:05:47,032 INFO L87 Difference]: Start difference. First operand 251 states and 299 transitions. Second operand 10 states. [2019-01-01 19:05:47,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:47,784 INFO L93 Difference]: Finished difference Result 435 states and 502 transitions. [2019-01-01 19:05:47,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 19:05:47,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-01-01 19:05:47,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:47,788 INFO L225 Difference]: With dead ends: 435 [2019-01-01 19:05:47,788 INFO L226 Difference]: Without dead ends: 435 [2019-01-01 19:05:47,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-01-01 19:05:47,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-01-01 19:05:47,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 258. [2019-01-01 19:05:47,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-01-01 19:05:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 308 transitions. [2019-01-01 19:05:47,795 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 308 transitions. Word has length 45 [2019-01-01 19:05:47,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:47,795 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 308 transitions. [2019-01-01 19:05:47,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 19:05:47,795 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 308 transitions. [2019-01-01 19:05:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 19:05:47,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:47,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:47,800 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:47,800 INFO L82 PathProgramCache]: Analyzing trace with hash -762728306, now seen corresponding path program 1 times [2019-01-01 19:05:47,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:47,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:47,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:47,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:47,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:48,329 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-01-01 19:05:48,543 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-01-01 19:05:48,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:05:48,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:48,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 19:05:48,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 19:05:48,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 19:05:48,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:05:48,642 INFO L87 Difference]: Start difference. First operand 258 states and 308 transitions. Second operand 10 states. [2019-01-01 19:05:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:49,780 INFO L93 Difference]: Finished difference Result 438 states and 506 transitions. [2019-01-01 19:05:49,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 19:05:49,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-01-01 19:05:49,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:49,784 INFO L225 Difference]: With dead ends: 438 [2019-01-01 19:05:49,784 INFO L226 Difference]: Without dead ends: 438 [2019-01-01 19:05:49,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-01-01 19:05:49,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-01-01 19:05:49,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 264. [2019-01-01 19:05:49,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-01-01 19:05:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 313 transitions. [2019-01-01 19:05:49,791 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 313 transitions. Word has length 45 [2019-01-01 19:05:49,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:49,791 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 313 transitions. [2019-01-01 19:05:49,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 19:05:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 313 transitions. [2019-01-01 19:05:49,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-01 19:05:49,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:49,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:49,792 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:49,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:49,793 INFO L82 PathProgramCache]: Analyzing trace with hash -390791237, now seen corresponding path program 1 times [2019-01-01 19:05:49,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:49,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:49,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:49,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:49,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:05:49,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:05:49,863 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 [2019-01-01 19:05:49,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:49,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:05:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:05:50,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:05:50,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 5 [2019-01-01 19:05:50,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:05:50,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:05:50,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=17, Unknown=2, NotChecked=0, Total=30 [2019-01-01 19:05:50,723 INFO L87 Difference]: Start difference. First operand 264 states and 313 transitions. Second operand 6 states. [2019-01-01 19:05:50,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:50,866 INFO L93 Difference]: Finished difference Result 295 states and 344 transitions. [2019-01-01 19:05:50,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:05:50,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-01-01 19:05:50,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:50,870 INFO L225 Difference]: With dead ends: 295 [2019-01-01 19:05:50,870 INFO L226 Difference]: Without dead ends: 271 [2019-01-01 19:05:50,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=11, Invalid=17, Unknown=2, NotChecked=0, Total=30 [2019-01-01 19:05:50,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-01-01 19:05:50,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2019-01-01 19:05:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-01 19:05:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 320 transitions. [2019-01-01 19:05:50,875 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 320 transitions. Word has length 46 [2019-01-01 19:05:50,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:50,876 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 320 transitions. [2019-01-01 19:05:50,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:05:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 320 transitions. [2019-01-01 19:05:50,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-01 19:05:50,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:50,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:50,877 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2019-01-01 19:05:50,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:50,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1467570882, now seen corresponding path program 1 times [2019-01-01 19:05:50,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:50,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:50,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:50,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:50,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 19:05:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 19:05:50,934 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 19:05:51,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 07:05:51 BoogieIcfgContainer [2019-01-01 19:05:51,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 19:05:51,012 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 19:05:51,012 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 19:05:51,017 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 19:05:51,017 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:05:22" (3/4) ... [2019-01-01 19:05:51,021 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 19:05:51,116 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 19:05:51,116 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 19:05:51,117 INFO L168 Benchmark]: Toolchain (without parser) took 30688.04 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 362.8 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -299.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 11.5 GB. [2019-01-01 19:05:51,119 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:05:51,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -156.9 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-01-01 19:05:51,121 INFO L168 Benchmark]: Boogie Preprocessor took 74.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:05:51,121 INFO L168 Benchmark]: RCFGBuilder took 1380.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.0 MB). Peak memory consumption was 75.0 MB. Max. memory is 11.5 GB. [2019-01-01 19:05:51,122 INFO L168 Benchmark]: TraceAbstraction took 28445.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -229.1 MB). Peak memory consumption was 2.6 MB. Max. memory is 11.5 GB. [2019-01-01 19:05:51,124 INFO L168 Benchmark]: Witness Printer took 103.77 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2019-01-01 19:05:51,129 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 678.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -156.9 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1380.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.0 MB). Peak memory consumption was 75.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28445.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -229.1 MB). Peak memory consumption was 2.6 MB. Max. memory is 11.5 GB. * Witness Printer took 103.77 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={3:0}, malloc(sizeof(SLL))={3:0}] [L992] list->next = ((void*)0) VAL [list={3:0}, malloc(sizeof(SLL))={3:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={3:0}, malloc(sizeof(SLL))={3:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) VAL [list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L993] EXPR list->inner VAL [list={3:0}, list->inner={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L993] list->inner->next = ((void*)0) VAL [list={3:0}, list->inner={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L993] EXPR list->inner VAL [list={3:0}, list->inner={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L993] list->inner->inner = ((void*)0) VAL [list={3:0}, list->inner={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L993] EXPR list->inner VAL [list={3:0}, list->inner={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={3:0}, list->inner={2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={3:0}, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={3:0}, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={3:0}, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={3:0}, len=0, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1017] EXPR end->inner VAL [end={3:0}, end->inner={2:0}, len=0, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={3:0}, inner={2:0}, len=0, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={3:0}, inner={2:0}, len=1, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={3:0}, inner={2:0}, len=1, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1025] EXPR inner->inner VAL [end={3:0}, inner={2:0}, inner->inner={0:0}, len=1, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={3:0}, inner={2:0}, inner->next={0:0}, len=1, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner VAL [end={3:0}, inner={2:0}, inner->inner={0:0}, len=1, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1027] inner = inner->inner [L1028] COND TRUE len == 1 VAL [end={3:0}, inner={0:0}, len=1, list={3:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1029] inner->inner - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 171 locations, 67 error locations. UNSAFE Result, 28.3s OverallTime, 27 OverallIterations, 2 TraceHistogramMax, 19.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3565 SDtfs, 6903 SDslu, 11154 SDs, 0 SdLazy, 9873 SolverSat, 468 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 152 SyntacticMatches, 7 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271occurred in iteration=26, 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.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 2387 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 948 NumberOfCodeBlocks, 948 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 873 ConstructedInterpolants, 10 QuantifiedInterpolants, 293820 SizeOfPredicates, 22 NumberOfNonLiveVariables, 475 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 29 InterpolantComputations, 23 PerfectInterpolantSequences, 10/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...