./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer --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 022e5e55adeb2213dd3e7a54e30f105429bff667 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 13:03:04,636 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 13:03:04,637 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 13:03:04,643 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 13:03:04,643 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 13:03:04,644 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 13:03:04,644 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 13:03:04,645 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 13:03:04,646 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 13:03:04,646 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 13:03:04,647 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 13:03:04,647 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 13:03:04,647 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 13:03:04,648 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 13:03:04,648 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 13:03:04,649 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 13:03:04,649 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 13:03:04,650 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 13:03:04,651 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 13:03:04,651 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 13:03:04,652 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 13:03:04,652 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 13:03:04,654 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 13:03:04,654 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 13:03:04,654 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 13:03:04,654 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 13:03:04,655 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 13:03:04,655 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 13:03:04,656 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 13:03:04,656 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 13:03:04,656 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 13:03:04,656 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 13:03:04,657 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 13:03:04,657 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 13:03:04,657 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 13:03:04,657 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 13:03:04,658 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-09 13:03:04,664 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 13:03:04,665 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 13:03:04,665 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 13:03:04,665 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 13:03:04,665 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 13:03:04,666 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 13:03:04,666 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 13:03:04,666 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 13:03:04,666 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 13:03:04,666 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 13:03:04,666 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 13:03:04,666 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 13:03:04,666 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 13:03:04,666 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 13:03:04,666 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 13:03:04,666 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 13:03:04,667 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 13:03:04,667 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 13:03:04,667 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 13:03:04,667 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 13:03:04,667 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 13:03:04,667 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 13:03:04,667 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 13:03:04,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 13:03:04,667 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 13:03:04,667 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 13:03:04,668 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 13:03:04,668 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 13:03:04,668 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer 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 -> 022e5e55adeb2213dd3e7a54e30f105429bff667 [2018-12-09 13:03:04,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 13:03:04,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 13:03:04,693 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 13:03:04,693 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 13:03:04,694 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 13:03:04,694 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 13:03:04,729 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer/data/2678f7de6/1bfb0f19d29c4ae689279a39b40156cb/FLAG5766432ca [2018-12-09 13:03:05,149 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 13:03:05,150 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 13:03:05,155 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer/data/2678f7de6/1bfb0f19d29c4ae689279a39b40156cb/FLAG5766432ca [2018-12-09 13:03:05,163 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer/data/2678f7de6/1bfb0f19d29c4ae689279a39b40156cb [2018-12-09 13:03:05,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 13:03:05,166 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 13:03:05,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 13:03:05,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 13:03:05,168 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 13:03:05,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:03:05" (1/1) ... [2018-12-09 13:03:05,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e809d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:03:05, skipping insertion in model container [2018-12-09 13:03:05,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:03:05" (1/1) ... [2018-12-09 13:03:05,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 13:03:05,191 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 13:03:05,332 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 13:03:05,339 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 13:03:05,398 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 13:03:05,418 INFO L195 MainTranslator]: Completed translation [2018-12-09 13:03:05,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:03:05 WrapperNode [2018-12-09 13:03:05,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 13:03:05,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 13:03:05,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 13:03:05,419 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 13:03:05,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:03:05" (1/1) ... [2018-12-09 13:03:05,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:03:05" (1/1) ... [2018-12-09 13:03:05,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:03:05" (1/1) ... [2018-12-09 13:03:05,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:03:05" (1/1) ... [2018-12-09 13:03:05,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:03:05" (1/1) ... [2018-12-09 13:03:05,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:03:05" (1/1) ... [2018-12-09 13:03:05,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:03:05" (1/1) ... [2018-12-09 13:03:05,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 13:03:05,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 13:03:05,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 13:03:05,447 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 13:03:05,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:03:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 13:03:05,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 13:03:05,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 13:03:05,478 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-09 13:03:05,478 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-09 13:03:05,478 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-12-09 13:03:05,478 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 13:03:05,478 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-09 13:03:05,478 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-09 13:03:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 13:03:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 13:03:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 13:03:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 13:03:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 13:03:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 13:03:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 13:03:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 13:03:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 13:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 13:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 13:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 13:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 13:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 13:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 13:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 13:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 13:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 13:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 13:03:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 13:03:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 13:03:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 13:03:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 13:03:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 13:03:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 13:03:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 13:03:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 13:03:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 13:03:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 13:03:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 13:03:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 13:03:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 13:03:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 13:03:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 13:03:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 13:03:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 13:03:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 13:03:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 13:03:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 13:03:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 13:03:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 13:03:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 13:03:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 13:03:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 13:03:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 13:03:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 13:03:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 13:03:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 13:03:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 13:03:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 13:03:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 13:03:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 13:03:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 13:03:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 13:03:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 13:03:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 13:03:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 13:03:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 13:03:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 13:03:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 13:03:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 13:03:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 13:03:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 13:03:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 13:03:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 13:03:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 13:03:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 13:03:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 13:03:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 13:03:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 13:03:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 13:03:05,486 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 13:03:05,486 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 13:03:05,486 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 13:03:05,486 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 13:03:05,486 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 13:03:05,486 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 13:03:05,486 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 13:03:05,486 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 13:03:05,486 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 13:03:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 13:03:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 13:03:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 13:03:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 13:03:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 13:03:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 13:03:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 13:03:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 13:03:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 13:03:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 13:03:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 13:03:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 13:03:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 13:03:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 13:03:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 13:03:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 13:03:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 13:03:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 13:03:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 13:03:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 13:03:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-09 13:03:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-12-09 13:03:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 13:03:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 13:03:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 13:03:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 13:03:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 13:03:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 13:03:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 13:03:05,730 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 13:03:05,731 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 13:03:05,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:03:05 BoogieIcfgContainer [2018-12-09 13:03:05,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 13:03:05,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 13:03:05,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 13:03:05,733 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 13:03:05,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:03:05" (1/3) ... [2018-12-09 13:03:05,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee98976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:03:05, skipping insertion in model container [2018-12-09 13:03:05,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:03:05" (2/3) ... [2018-12-09 13:03:05,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee98976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:03:05, skipping insertion in model container [2018-12-09 13:03:05,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:03:05" (3/3) ... [2018-12-09 13:03:05,735 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 13:03:05,741 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 13:03:05,746 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-09 13:03:05,756 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-09 13:03:05,770 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 13:03:05,771 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 13:03:05,771 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 13:03:05,771 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 13:03:05,771 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 13:03:05,771 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 13:03:05,771 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 13:03:05,772 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 13:03:05,772 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 13:03:05,781 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-12-09 13:03:05,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 13:03:05,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:05,788 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:03:05,790 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 13:03:05,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:05,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1826097680, now seen corresponding path program 1 times [2018-12-09 13:03:05,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:03:05,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:03:05,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:05,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:05,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:05,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:03:05,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 13:03:05,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:03:05,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:03:05,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:03:05,914 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2018-12-09 13:03:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:05,961 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-12-09 13:03:05,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:03:05,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 13:03:05,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:05,968 INFO L225 Difference]: With dead ends: 48 [2018-12-09 13:03:05,968 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 13:03:05,970 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 [2018-12-09 13:03:05,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 13:03:05,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 13:03:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 13:03:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-09 13:03:05,992 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2018-12-09 13:03:05,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:05,993 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-09 13:03:05,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:03:05,993 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-09 13:03:05,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 13:03:05,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:05,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:03:05,993 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 13:03:05,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:05,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1826097681, now seen corresponding path program 1 times [2018-12-09 13:03:05,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:03:05,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:03:05,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:05,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:05,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:06,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:06,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:03:06,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:03:06,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 13:03:06,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 13:03:06,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 13:03:06,024 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 4 states. [2018-12-09 13:03:06,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:06,037 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-09 13:03:06,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 13:03:06,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 13:03:06,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:06,038 INFO L225 Difference]: With dead ends: 44 [2018-12-09 13:03:06,038 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 13:03:06,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 13:03:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 13:03:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 13:03:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 13:03:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-09 13:03:06,041 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 10 [2018-12-09 13:03:06,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:06,041 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-09 13:03:06,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 13:03:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-09 13:03:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 13:03:06,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:06,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:03:06,042 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 13:03:06,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:06,042 INFO L82 PathProgramCache]: Analyzing trace with hash 774453223, now seen corresponding path program 1 times [2018-12-09 13:03:06,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:03:06,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:03:06,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:06,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:06,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:06,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:03:06,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 13:03:06,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:03:06,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:03:06,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:03:06,063 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2018-12-09 13:03:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:06,082 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-12-09 13:03:06,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:03:06,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 13:03:06,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:06,082 INFO L225 Difference]: With dead ends: 43 [2018-12-09 13:03:06,083 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 13:03:06,083 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 [2018-12-09 13:03:06,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 13:03:06,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 13:03:06,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 13:03:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-09 13:03:06,085 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2018-12-09 13:03:06,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:06,085 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-09 13:03:06,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:03:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-09 13:03:06,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 13:03:06,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:06,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:03:06,086 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 13:03:06,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:06,086 INFO L82 PathProgramCache]: Analyzing trace with hash 774453224, now seen corresponding path program 1 times [2018-12-09 13:03:06,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:03:06,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:03:06,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:06,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:06,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:03:06,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:03:06,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 13:03:06,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 13:03:06,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 13:03:06,118 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-12-09 13:03:06,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:06,126 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-09 13:03:06,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 13:03:06,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 13:03:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:06,127 INFO L225 Difference]: With dead ends: 42 [2018-12-09 13:03:06,127 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 13:03:06,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 13:03:06,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 13:03:06,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 13:03:06,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 13:03:06,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-09 13:03:06,129 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 11 [2018-12-09 13:03:06,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:06,129 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-09 13:03:06,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 13:03:06,129 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-09 13:03:06,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 13:03:06,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:06,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:03:06,130 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 13:03:06,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:06,130 INFO L82 PathProgramCache]: Analyzing trace with hash -828291080, now seen corresponding path program 1 times [2018-12-09 13:03:06,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:03:06,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:03:06,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:06,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:06,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:03:06,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 13:03:06,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 13:03:06,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 13:03:06,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 13:03:06,152 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-12-09 13:03:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:06,195 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-12-09 13:03:06,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 13:03:06,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 13:03:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:06,196 INFO L225 Difference]: With dead ends: 40 [2018-12-09 13:03:06,196 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 13:03:06,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:03:06,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 13:03:06,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 13:03:06,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 13:03:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-09 13:03:06,198 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2018-12-09 13:03:06,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:06,198 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-09 13:03:06,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 13:03:06,198 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-09 13:03:06,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 13:03:06,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:06,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:03:06,199 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 13:03:06,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:06,199 INFO L82 PathProgramCache]: Analyzing trace with hash -828291079, now seen corresponding path program 1 times [2018-12-09 13:03:06,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:03:06,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:03:06,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:06,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:06,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:03:06,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 13:03:06,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 13:03:06,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 13:03:06,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 13:03:06,248 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2018-12-09 13:03:06,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:06,320 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-12-09 13:03:06,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 13:03:06,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-09 13:03:06,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:06,323 INFO L225 Difference]: With dead ends: 62 [2018-12-09 13:03:06,323 INFO L226 Difference]: Without dead ends: 62 [2018-12-09 13:03:06,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 13:03:06,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-09 13:03:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-12-09 13:03:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 13:03:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-09 13:03:06,326 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 14 [2018-12-09 13:03:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:06,327 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-09 13:03:06,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 13:03:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-09 13:03:06,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 13:03:06,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:06,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:03:06,327 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 13:03:06,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:06,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1940862338, now seen corresponding path program 1 times [2018-12-09 13:03:06,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:03:06,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:03:06,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:06,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:06,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:03:06,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 13:03:06,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 13:03:06,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 13:03:06,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:03:06,354 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2018-12-09 13:03:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:06,403 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-12-09 13:03:06,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 13:03:06,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-09 13:03:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:06,404 INFO L225 Difference]: With dead ends: 43 [2018-12-09 13:03:06,404 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 13:03:06,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 13:03:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 13:03:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-12-09 13:03:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 13:03:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-09 13:03:06,408 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2018-12-09 13:03:06,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:06,408 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-09 13:03:06,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 13:03:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-12-09 13:03:06,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 13:03:06,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:06,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:03:06,409 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 13:03:06,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:06,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1940862337, now seen corresponding path program 1 times [2018-12-09 13:03:06,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:03:06,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:03:06,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:06,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:06,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:06,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:03:06,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 13:03:06,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 13:03:06,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 13:03:06,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 13:03:06,481 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2018-12-09 13:03:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:06,551 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-12-09 13:03:06,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 13:03:06,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-09 13:03:06,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:06,552 INFO L225 Difference]: With dead ends: 55 [2018-12-09 13:03:06,552 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 13:03:06,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-09 13:03:06,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 13:03:06,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-12-09 13:03:06,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 13:03:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-12-09 13:03:06,556 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2018-12-09 13:03:06,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:06,556 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-12-09 13:03:06,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 13:03:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-12-09 13:03:06,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 13:03:06,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:06,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:03:06,557 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 13:03:06,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:06,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1170138931, now seen corresponding path program 1 times [2018-12-09 13:03:06,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:03:06,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:03:06,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:06,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:06,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:03:06,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:03:06,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 13:03:06,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 13:03:06,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 13:03:06,600 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2018-12-09 13:03:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:06,640 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-12-09 13:03:06,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 13:03:06,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 13:03:06,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:06,641 INFO L225 Difference]: With dead ends: 46 [2018-12-09 13:03:06,641 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 13:03:06,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 13:03:06,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 13:03:06,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 13:03:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 13:03:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-12-09 13:03:06,643 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2018-12-09 13:03:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:06,643 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-09 13:03:06,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 13:03:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-12-09 13:03:06,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 13:03:06,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:06,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:03:06,644 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 13:03:06,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:06,644 INFO L82 PathProgramCache]: Analyzing trace with hash 164977750, now seen corresponding path program 1 times [2018-12-09 13:03:06,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:03:06,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:03:06,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:06,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:06,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:03:06,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:03:06,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:03:06,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:03:06,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:03:06,657 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-12-09 13:03:06,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:06,662 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-12-09 13:03:06,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:03:06,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 13:03:06,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:06,663 INFO L225 Difference]: With dead ends: 43 [2018-12-09 13:03:06,663 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 13:03:06,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:03:06,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 13:03:06,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 13:03:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 13:03:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-09 13:03:06,665 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 22 [2018-12-09 13:03:06,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:06,666 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-09 13:03:06,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:03:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-09 13:03:06,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 13:03:06,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:06,666 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] [2018-12-09 13:03:06,667 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 13:03:06,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:06,667 INFO L82 PathProgramCache]: Analyzing trace with hash -376031245, now seen corresponding path program 1 times [2018-12-09 13:03:06,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:03:06,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:03:06,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:06,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 13:03:06,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:03:06,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 13:03:06,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 13:03:06,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 13:03:06,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 13:03:06,735 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 8 states. [2018-12-09 13:03:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:06,804 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-12-09 13:03:06,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 13:03:06,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-12-09 13:03:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:06,805 INFO L225 Difference]: With dead ends: 51 [2018-12-09 13:03:06,805 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 13:03:06,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 13:03:06,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 13:03:06,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 13:03:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 13:03:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-09 13:03:06,807 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2018-12-09 13:03:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:06,807 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-09 13:03:06,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 13:03:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-09 13:03:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 13:03:06,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:06,808 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] [2018-12-09 13:03:06,808 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 13:03:06,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:06,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1924791345, now seen corresponding path program 1 times [2018-12-09 13:03:06,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:03:06,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:03:06,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:06,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:06,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:03:06,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 13:03:06,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 13:03:06,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 13:03:06,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-09 13:03:06,891 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 10 states. [2018-12-09 13:03:06,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:06,970 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-12-09 13:03:06,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 13:03:06,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-09 13:03:06,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:06,971 INFO L225 Difference]: With dead ends: 64 [2018-12-09 13:03:06,971 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 13:03:06,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 13:03:06,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 13:03:06,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-12-09 13:03:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-09 13:03:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-12-09 13:03:06,973 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 24 [2018-12-09 13:03:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:06,974 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-12-09 13:03:06,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 13:03:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-12-09 13:03:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 13:03:06,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:06,974 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] [2018-12-09 13:03:06,974 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 13:03:06,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:06,974 INFO L82 PathProgramCache]: Analyzing trace with hash 336443443, now seen corresponding path program 1 times [2018-12-09 13:03:06,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:03:06,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:03:06,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:06,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:07,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:03:07,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:03:07,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:07,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:03:07,176 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 14 treesize of output 11 [2018-12-09 13:03:07,178 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 11 treesize of output 10 [2018-12-09 13:03:07,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:03:07,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:03:07,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:03:07,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 13:03:07,276 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 18 treesize of output 14 [2018-12-09 13:03:07,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 13:03:07,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 13:03:07,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:03:07,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:03:07,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-09 13:03:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:07,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:03:07,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-12-09 13:03:07,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 13:03:07,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 13:03:07,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-12-09 13:03:07,403 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 19 states. [2018-12-09 13:03:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:08,120 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-12-09 13:03:08,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 13:03:08,121 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-09 13:03:08,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:08,122 INFO L225 Difference]: With dead ends: 86 [2018-12-09 13:03:08,122 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 13:03:08,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-12-09 13:03:08,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 13:03:08,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2018-12-09 13:03:08,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 13:03:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-12-09 13:03:08,125 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 24 [2018-12-09 13:03:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:08,125 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-12-09 13:03:08,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 13:03:08,125 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-12-09 13:03:08,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 13:03:08,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:08,126 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] [2018-12-09 13:03:08,126 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 13:03:08,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:08,126 INFO L82 PathProgramCache]: Analyzing trace with hash -280555850, now seen corresponding path program 1 times [2018-12-09 13:03:08,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:03:08,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:03:08,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:08,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:08,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:08,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:03:08,234 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:03:08,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:08,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:03:08,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 13:03:08,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:03:08,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:03:08,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-09 13:03:08,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 13:03:08,292 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 11 treesize of output 10 [2018-12-09 13:03:08,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:03:08,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:03:08,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:03:08,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-09 13:03:08,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-09 13:03:08,317 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 11 treesize of output 10 [2018-12-09 13:03:08,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:03:08,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:03:08,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 13:03:08,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-09 13:03:08,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-09 13:03:08,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 13:03:08,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 13:03:08,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-09 13:03:08,410 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 13:03:08,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:03:08,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:03:08,424 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-12-09 13:03:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:08,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:03:08,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-12-09 13:03:08,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 13:03:08,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 13:03:08,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-09 13:03:08,483 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 17 states. [2018-12-09 13:03:08,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:08,856 INFO L93 Difference]: Finished difference Result 146 states and 167 transitions. [2018-12-09 13:03:08,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 13:03:08,857 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-12-09 13:03:08,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:08,857 INFO L225 Difference]: With dead ends: 146 [2018-12-09 13:03:08,857 INFO L226 Difference]: Without dead ends: 146 [2018-12-09 13:03:08,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-12-09 13:03:08,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-09 13:03:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 107. [2018-12-09 13:03:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 13:03:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2018-12-09 13:03:08,862 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 25 [2018-12-09 13:03:08,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:08,862 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2018-12-09 13:03:08,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 13:03:08,862 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2018-12-09 13:03:08,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 13:03:08,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:08,863 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:03:08,863 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 13:03:08,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:08,863 INFO L82 PathProgramCache]: Analyzing trace with hash 185536167, now seen corresponding path program 2 times [2018-12-09 13:03:08,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:03:08,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:03:08,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:08,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:08,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:09,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:03:09,055 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:03:09,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 13:03:09,083 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 13:03:09,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 13:03:09,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:03:09,089 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 13:03:09,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 13:03:09,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 13:03:09,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:03:09,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:03:09,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-09 13:03:09,118 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 16 treesize of output 13 [2018-12-09 13:03:09,119 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 13 treesize of output 12 [2018-12-09 13:03:09,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:03:09,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:03:09,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:03:09,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 13:03:09,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 13:03:09,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 13:03:09,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 13:03:09,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:03:09,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:03:09,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-12-09 13:03:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:09,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:03:09,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-12-09 13:03:09,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 13:03:09,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 13:03:09,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-12-09 13:03:09,318 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand 20 states. [2018-12-09 13:03:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:10,338 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2018-12-09 13:03:10,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 13:03:10,338 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-12-09 13:03:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:10,339 INFO L225 Difference]: With dead ends: 148 [2018-12-09 13:03:10,339 INFO L226 Difference]: Without dead ends: 148 [2018-12-09 13:03:10,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 13:03:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-09 13:03:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 76. [2018-12-09 13:03:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 13:03:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-12-09 13:03:10,343 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 30 [2018-12-09 13:03:10,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:10,343 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-12-09 13:03:10,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 13:03:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-12-09 13:03:10,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 13:03:10,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:10,344 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:03:10,344 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 13:03:10,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:10,344 INFO L82 PathProgramCache]: Analyzing trace with hash -566502313, now seen corresponding path program 2 times [2018-12-09 13:03:10,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:03:10,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:03:10,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:10,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 13:03:10,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:10,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:03:10,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:03:10,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 13:03:10,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 13:03:10,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 13:03:10,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:03:10,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 13:03:10,532 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 12 treesize of output 15 [2018-12-09 13:03:10,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:03:10,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:03:10,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 13:03:10,542 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 13:03:10,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:03:10,547 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-09 13:03:10,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 13:03:10,566 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 13 treesize of output 12 [2018-12-09 13:03:10,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:03:10,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:03:10,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:03:10,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-12-09 13:03:10,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-09 13:03:10,600 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 13 treesize of output 12 [2018-12-09 13:03:10,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:03:10,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:03:10,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 13:03:10,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-12-09 13:03:10,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-12-09 13:03:10,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 13:03:10,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 13:03:10,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-12-09 13:03:10,746 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 13:03:10,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:03:10,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:03:10,756 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-12-09 13:03:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:03:10,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:03:10,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-12-09 13:03:10,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 13:03:10,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 13:03:10,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-12-09 13:03:10,817 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 17 states. [2018-12-09 13:03:12,164 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2018-12-09 13:03:12,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:12,653 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-12-09 13:03:12,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 13:03:12,653 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-12-09 13:03:12,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:12,653 INFO L225 Difference]: With dead ends: 93 [2018-12-09 13:03:12,653 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 13:03:12,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2018-12-09 13:03:12,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 13:03:12,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 13:03:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 13:03:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 13:03:12,654 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-12-09 13:03:12,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:12,654 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 13:03:12,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 13:03:12,654 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 13:03:12,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 13:03:12,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:03:12 BoogieIcfgContainer [2018-12-09 13:03:12,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 13:03:12,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 13:03:12,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 13:03:12,658 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 13:03:12,658 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:03:05" (3/4) ... [2018-12-09 13:03:12,660 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 13:03:12,665 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 13:03:12,665 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcspn [2018-12-09 13:03:12,665 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-09 13:03:12,665 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-09 13:03:12,665 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 13:03:12,667 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-09 13:03:12,668 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-09 13:03:12,668 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 13:03:12,694 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7973a8b1-1c1b-4f4d-82a4-582cf923dbc1/bin-2019/uautomizer/witness.graphml [2018-12-09 13:03:12,695 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 13:03:12,695 INFO L168 Benchmark]: Toolchain (without parser) took 7529.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2018-12-09 13:03:12,695 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:03:12,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-09 13:03:12,696 INFO L168 Benchmark]: Boogie Preprocessor took 28.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 13:03:12,696 INFO L168 Benchmark]: RCFGBuilder took 283.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2018-12-09 13:03:12,696 INFO L168 Benchmark]: TraceAbstraction took 6926.14 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -60.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:03:12,696 INFO L168 Benchmark]: Witness Printer took 36.74 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. [2018-12-09 13:03:12,697 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 252.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 283.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6926.14 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -60.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 36.74 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 55 locations, 15 error locations. SAFE Result, 6.8s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 528 SDtfs, 1233 SDslu, 1736 SDs, 0 SdLazy, 1838 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 105 SyntacticMatches, 6 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 161 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 426 NumberOfCodeBlocks, 426 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 406 ConstructedInterpolants, 37 QuantifiedInterpolants, 106186 SizeOfPredicates, 43 NumberOfNonLiveVariables, 579 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 5/49 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...