./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrpbrk-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_59d9d96d-368e-464a-bfd7-26e49c0d60ef/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/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 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 14:31:34,515 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 14:31:34,516 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 14:31:34,522 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 14:31:34,522 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 14:31:34,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 14:31:34,523 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 14:31:34,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 14:31:34,526 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 14:31:34,526 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 14:31:34,527 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 14:31:34,527 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 14:31:34,528 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 14:31:34,528 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 14:31:34,529 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 14:31:34,529 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 14:31:34,529 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 14:31:34,530 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 14:31:34,531 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 14:31:34,532 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 14:31:34,532 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 14:31:34,533 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 14:31:34,535 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 14:31:34,535 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 14:31:34,535 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 14:31:34,536 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 14:31:34,536 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 14:31:34,536 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 14:31:34,537 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 14:31:34,537 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 14:31:34,538 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 14:31:34,538 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 14:31:34,538 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 14:31:34,538 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 14:31:34,538 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 14:31:34,539 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 14:31:34,539 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-08 14:31:34,546 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 14:31:34,546 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 14:31:34,546 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 14:31:34,546 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 14:31:34,547 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 14:31:34,547 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 14:31:34,547 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 14:31:34,547 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 14:31:34,548 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 14:31:34,548 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 14:31:34,548 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 14:31:34,548 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 14:31:34,548 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 14:31:34,548 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 14:31:34,548 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 14:31:34,549 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 14:31:34,549 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 14:31:34,549 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 14:31:34,549 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 14:31:34,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 14:31:34,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 14:31:34,550 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 14:31:34,550 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 14:31:34,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 14:31:34,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 14:31:34,550 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 14:31:34,550 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 14:31:34,550 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 14:31:34,551 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_59d9d96d-368e-464a-bfd7-26e49c0d60ef/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 -> 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 [2018-12-08 14:31:34,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 14:31:34,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 14:31:34,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 14:31:34,578 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 14:31:34,578 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 14:31:34,579 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-08 14:31:34,612 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/bin-2019/uautomizer/data/95a0295f5/9075de16a3df4386ae9e59425e430742/FLAG077551f1b [2018-12-08 14:31:35,061 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 14:31:35,062 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-08 14:31:35,068 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/bin-2019/uautomizer/data/95a0295f5/9075de16a3df4386ae9e59425e430742/FLAG077551f1b [2018-12-08 14:31:35,077 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/bin-2019/uautomizer/data/95a0295f5/9075de16a3df4386ae9e59425e430742 [2018-12-08 14:31:35,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 14:31:35,080 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-08 14:31:35,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 14:31:35,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 14:31:35,082 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 14:31:35,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:31:35" (1/1) ... [2018-12-08 14:31:35,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4834854b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:35, skipping insertion in model container [2018-12-08 14:31:35,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:31:35" (1/1) ... [2018-12-08 14:31:35,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 14:31:35,107 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 14:31:35,248 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:31:35,254 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 14:31:35,322 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:31:35,350 INFO L195 MainTranslator]: Completed translation [2018-12-08 14:31:35,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:35 WrapperNode [2018-12-08 14:31:35,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 14:31:35,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 14:31:35,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 14:31:35,351 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 14:31:35,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:35" (1/1) ... [2018-12-08 14:31:35,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:35" (1/1) ... [2018-12-08 14:31:35,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:35" (1/1) ... [2018-12-08 14:31:35,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:35" (1/1) ... [2018-12-08 14:31:35,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:35" (1/1) ... [2018-12-08 14:31:35,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:35" (1/1) ... [2018-12-08 14:31:35,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:35" (1/1) ... [2018-12-08 14:31:35,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 14:31:35,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 14:31:35,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 14:31:35,379 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 14:31:35,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/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-08 14:31:35,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 14:31:35,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 14:31:35,410 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-08 14:31:35,410 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-08 14:31:35,410 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-12-08 14:31:35,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 14:31:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-08 14:31:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-08 14:31:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-08 14:31:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-08 14:31:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-08 14:31:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-08 14:31:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-08 14:31:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-08 14:31:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-08 14:31:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-08 14:31:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-08 14:31:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-08 14:31:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-08 14:31:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-08 14:31:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-08 14:31:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-08 14:31:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-08 14:31:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-08 14:31:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-08 14:31:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-08 14:31:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-08 14:31:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-08 14:31:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-08 14:31:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-08 14:31:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-08 14:31:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-08 14:31:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-08 14:31:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-08 14:31:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-08 14:31:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-08 14:31:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-08 14:31:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-08 14:31:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-08 14:31:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-08 14:31:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-08 14:31:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-08 14:31:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-08 14:31:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-08 14:31:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-08 14:31:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-08 14:31:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-08 14:31:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-08 14:31:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-08 14:31:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-08 14:31:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-08 14:31:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-08 14:31:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-08 14:31:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-08 14:31:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-08 14:31:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-08 14:31:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-08 14:31:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-08 14:31:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-08 14:31:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-08 14:31:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-08 14:31:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-08 14:31:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-08 14:31:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-08 14:31:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-08 14:31:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-08 14:31:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-08 14:31:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-08 14:31:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-08 14:31:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-08 14:31:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-08 14:31:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-08 14:31:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-08 14:31:35,417 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-08 14:31:35,417 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-08 14:31:35,417 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-08 14:31:35,417 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-08 14:31:35,417 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-08 14:31:35,417 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-08 14:31:35,417 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-08 14:31:35,417 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-08 14:31:35,417 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-08 14:31:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-08 14:31:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-08 14:31:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-08 14:31:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-08 14:31:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-08 14:31:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-08 14:31:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-08 14:31:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-08 14:31:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-08 14:31:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-08 14:31:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-08 14:31:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-08 14:31:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-08 14:31:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-08 14:31:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-08 14:31:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-08 14:31:35,420 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-08 14:31:35,420 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-08 14:31:35,420 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-08 14:31:35,420 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-08 14:31:35,420 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-08 14:31:35,420 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-08 14:31:35,420 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-08 14:31:35,420 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-08 14:31:35,420 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-08 14:31:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-08 14:31:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-08 14:31:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-12-08 14:31:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 14:31:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 14:31:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 14:31:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 14:31:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 14:31:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 14:31:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 14:31:35,633 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 14:31:35,633 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-08 14:31:35,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:31:35 BoogieIcfgContainer [2018-12-08 14:31:35,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 14:31:35,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 14:31:35,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 14:31:35,636 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 14:31:35,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 02:31:35" (1/3) ... [2018-12-08 14:31:35,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bbf020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 02:31:35, skipping insertion in model container [2018-12-08 14:31:35,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:35" (2/3) ... [2018-12-08 14:31:35,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bbf020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 02:31:35, skipping insertion in model container [2018-12-08 14:31:35,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:31:35" (3/3) ... [2018-12-08 14:31:35,638 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-08 14:31:35,643 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 14:31:35,648 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-08 14:31:35,657 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-08 14:31:35,671 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 14:31:35,671 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 14:31:35,671 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 14:31:35,672 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 14:31:35,672 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 14:31:35,672 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 14:31:35,672 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 14:31:35,672 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 14:31:35,672 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 14:31:35,680 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-12-08 14:31:35,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 14:31:35,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:31:35,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:31:35,687 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-08 14:31:35,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:35,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1879598342, now seen corresponding path program 1 times [2018-12-08 14:31:35,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:35,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:35,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:35,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:35,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:35,787 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-08 14:31:35,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:31:35,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:31:35,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:31:35,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:31:35,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:31:35,800 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2018-12-08 14:31:35,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:31:35,831 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-12-08 14:31:35,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:31:35,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-08 14:31:35,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:31:35,838 INFO L225 Difference]: With dead ends: 48 [2018-12-08 14:31:35,838 INFO L226 Difference]: Without dead ends: 45 [2018-12-08 14:31:35,839 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-08 14:31:35,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-08 14:31:35,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-08 14:31:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-08 14:31:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-08 14:31:35,859 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2018-12-08 14:31:35,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:31:35,859 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-08 14:31:35,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:31:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-08 14:31:35,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 14:31:35,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:31:35,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:31:35,860 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-08 14:31:35,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:35,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1879598343, now seen corresponding path program 1 times [2018-12-08 14:31:35,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:35,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:35,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:35,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:35,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:35,895 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-08 14:31:35,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:31:35,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 14:31:35,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 14:31:35,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 14:31:35,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 14:31:35,896 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 4 states. [2018-12-08 14:31:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:31:35,910 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-08 14:31:35,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 14:31:35,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-08 14:31:35,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:31:35,911 INFO L225 Difference]: With dead ends: 44 [2018-12-08 14:31:35,911 INFO L226 Difference]: Without dead ends: 44 [2018-12-08 14:31:35,912 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-08 14:31:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-08 14:31:35,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-08 14:31:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-08 14:31:35,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-08 14:31:35,914 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 10 [2018-12-08 14:31:35,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:31:35,915 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-08 14:31:35,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 14:31:35,915 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-08 14:31:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 14:31:35,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:31:35,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:31:35,915 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-08 14:31:35,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:35,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1861993495, now seen corresponding path program 1 times [2018-12-08 14:31:35,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:35,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:35,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:35,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:35,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:35,932 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-08 14:31:35,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:31:35,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:31:35,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:31:35,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:31:35,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:31:35,933 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2018-12-08 14:31:35,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:31:35,959 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-12-08 14:31:35,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:31:35,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-08 14:31:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:31:35,960 INFO L225 Difference]: With dead ends: 43 [2018-12-08 14:31:35,960 INFO L226 Difference]: Without dead ends: 43 [2018-12-08 14:31:35,960 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-08 14:31:35,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-08 14:31:35,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-08 14:31:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-08 14:31:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-08 14:31:35,963 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2018-12-08 14:31:35,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:31:35,963 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-08 14:31:35,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:31:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-08 14:31:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 14:31:35,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:31:35,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:31:35,963 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-08 14:31:35,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:35,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1861993494, now seen corresponding path program 1 times [2018-12-08 14:31:35,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:35,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:35,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:35,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:35,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:35,996 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-08 14:31:35,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:31:35,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 14:31:35,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 14:31:35,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 14:31:35,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 14:31:35,997 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-12-08 14:31:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:31:36,007 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-08 14:31:36,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 14:31:36,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-08 14:31:36,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:31:36,008 INFO L225 Difference]: With dead ends: 42 [2018-12-08 14:31:36,008 INFO L226 Difference]: Without dead ends: 42 [2018-12-08 14:31:36,008 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-08 14:31:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-08 14:31:36,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-08 14:31:36,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-08 14:31:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-08 14:31:36,011 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 11 [2018-12-08 14:31:36,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:31:36,011 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-08 14:31:36,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 14:31:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-08 14:31:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 14:31:36,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:31:36,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:31:36,011 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-08 14:31:36,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:36,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1145525834, now seen corresponding path program 1 times [2018-12-08 14:31:36,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:36,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:36,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:36,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:36,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:36,037 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-08 14:31:36,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:31:36,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 14:31:36,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 14:31:36,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 14:31:36,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 14:31:36,038 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-12-08 14:31:36,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:31:36,076 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-12-08 14:31:36,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 14:31:36,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-08 14:31:36,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:31:36,077 INFO L225 Difference]: With dead ends: 40 [2018-12-08 14:31:36,077 INFO L226 Difference]: Without dead ends: 40 [2018-12-08 14:31:36,077 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-08 14:31:36,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-08 14:31:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-08 14:31:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-08 14:31:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-08 14:31:36,081 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2018-12-08 14:31:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:31:36,081 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-08 14:31:36,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 14:31:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-08 14:31:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 14:31:36,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:31:36,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:31:36,082 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-08 14:31:36,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:36,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1145525833, now seen corresponding path program 1 times [2018-12-08 14:31:36,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:36,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:36,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:36,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:36,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:36,135 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-08 14:31:36,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:31:36,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 14:31:36,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 14:31:36,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 14:31:36,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 14:31:36,136 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2018-12-08 14:31:36,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:31:36,194 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-12-08 14:31:36,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:31:36,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-08 14:31:36,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:31:36,197 INFO L225 Difference]: With dead ends: 62 [2018-12-08 14:31:36,197 INFO L226 Difference]: Without dead ends: 62 [2018-12-08 14:31:36,197 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-08 14:31:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-08 14:31:36,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-12-08 14:31:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-08 14:31:36,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-08 14:31:36,201 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 14 [2018-12-08 14:31:36,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:31:36,201 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-08 14:31:36,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 14:31:36,201 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-08 14:31:36,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 14:31:36,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:31:36,202 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-08 14:31:36,202 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-08 14:31:36,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:36,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2000279356, now seen corresponding path program 1 times [2018-12-08 14:31:36,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:36,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:36,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:36,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:36,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:36,235 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-08 14:31:36,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:31:36,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 14:31:36,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 14:31:36,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:31:36,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:31:36,236 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2018-12-08 14:31:36,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:31:36,296 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-12-08 14:31:36,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:31:36,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-08 14:31:36,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:31:36,296 INFO L225 Difference]: With dead ends: 43 [2018-12-08 14:31:36,297 INFO L226 Difference]: Without dead ends: 43 [2018-12-08 14:31:36,297 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-08 14:31:36,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-08 14:31:36,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-12-08 14:31:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-08 14:31:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-08 14:31:36,299 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2018-12-08 14:31:36,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:31:36,299 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-08 14:31:36,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 14:31:36,299 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-12-08 14:31:36,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 14:31:36,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:31:36,300 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-08 14:31:36,300 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-08 14:31:36,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:36,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2000279357, now seen corresponding path program 1 times [2018-12-08 14:31:36,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:36,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:36,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:36,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:36,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:36,363 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-08 14:31:36,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:31:36,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 14:31:36,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 14:31:36,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 14:31:36,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 14:31:36,364 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2018-12-08 14:31:36,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:31:36,441 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-12-08 14:31:36,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 14:31:36,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-08 14:31:36,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:31:36,441 INFO L225 Difference]: With dead ends: 55 [2018-12-08 14:31:36,441 INFO L226 Difference]: Without dead ends: 55 [2018-12-08 14:31:36,442 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-08 14:31:36,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-08 14:31:36,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-12-08 14:31:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-08 14:31:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-12-08 14:31:36,445 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2018-12-08 14:31:36,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:31:36,445 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-12-08 14:31:36,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 14:31:36,445 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-12-08 14:31:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 14:31:36,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:31:36,446 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-08 14:31:36,446 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-08 14:31:36,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:36,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1894101213, now seen corresponding path program 1 times [2018-12-08 14:31:36,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:36,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:36,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:36,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:36,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:36,486 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-08 14:31:36,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:31:36,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 14:31:36,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 14:31:36,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 14:31:36,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 14:31:36,486 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2018-12-08 14:31:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:31:36,520 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-12-08 14:31:36,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 14:31:36,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-08 14:31:36,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:31:36,521 INFO L225 Difference]: With dead ends: 46 [2018-12-08 14:31:36,521 INFO L226 Difference]: Without dead ends: 41 [2018-12-08 14:31:36,521 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-08 14:31:36,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-08 14:31:36,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-08 14:31:36,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-08 14:31:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-12-08 14:31:36,523 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2018-12-08 14:31:36,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:31:36,523 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-08 14:31:36,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 14:31:36,523 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-12-08 14:31:36,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 14:31:36,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:31:36,523 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-08 14:31:36,524 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-08 14:31:36,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:36,524 INFO L82 PathProgramCache]: Analyzing trace with hash 197301268, now seen corresponding path program 1 times [2018-12-08 14:31:36,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:36,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:36,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:36,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:36,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:36,537 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-08 14:31:36,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:31:36,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 14:31:36,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:31:36,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:31:36,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:31:36,539 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-12-08 14:31:36,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:31:36,543 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-12-08 14:31:36,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:31:36,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-08 14:31:36,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:31:36,544 INFO L225 Difference]: With dead ends: 43 [2018-12-08 14:31:36,544 INFO L226 Difference]: Without dead ends: 43 [2018-12-08 14:31:36,545 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-08 14:31:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-08 14:31:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-08 14:31:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-08 14:31:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-08 14:31:36,547 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 22 [2018-12-08 14:31:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:31:36,547 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-08 14:31:36,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:31:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-08 14:31:36,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 14:31:36,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:31:36,548 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-08 14:31:36,548 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-08 14:31:36,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:36,548 INFO L82 PathProgramCache]: Analyzing trace with hash 622097713, now seen corresponding path program 1 times [2018-12-08 14:31:36,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:36,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:36,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:36,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:36,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:36,659 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-08 14:31:36,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:31:36,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 14:31:36,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 14:31:36,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 14:31:36,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-08 14:31:36,660 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 10 states. [2018-12-08 14:31:36,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:31:36,767 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-12-08 14:31:36,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 14:31:36,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-08 14:31:36,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:31:36,768 INFO L225 Difference]: With dead ends: 64 [2018-12-08 14:31:36,768 INFO L226 Difference]: Without dead ends: 64 [2018-12-08 14:31:36,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-08 14:31:36,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-08 14:31:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-12-08 14:31:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-08 14:31:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-12-08 14:31:36,771 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 24 [2018-12-08 14:31:36,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:31:36,771 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-12-08 14:31:36,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 14:31:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-12-08 14:31:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 14:31:36,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:31:36,772 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-08 14:31:36,772 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-08 14:31:36,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:36,772 INFO L82 PathProgramCache]: Analyzing trace with hash -966250189, now seen corresponding path program 1 times [2018-12-08 14:31:36,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:36,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:36,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:36,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:36,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:36,942 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-08 14:31:36,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:31:36,942 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/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-08 14:31:36,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:36,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:31:36,997 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-08 14:31:36,998 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-08 14:31:36,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:37,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:31:37,007 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-08 14:31:37,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-08 14:31:37,094 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-08 14:31:37,100 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-08 14:31:37,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 14:31:37,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 14:31:37,112 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-08 14:31:37,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-08 14:31:37,184 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-08 14:31:37,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:31:37,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-12-08 14:31:37,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 14:31:37,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 14:31:37,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-12-08 14:31:37,199 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 19 states. [2018-12-08 14:31:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:31:37,827 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-12-08 14:31:37,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 14:31:37,827 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-08 14:31:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:31:37,828 INFO L225 Difference]: With dead ends: 86 [2018-12-08 14:31:37,828 INFO L226 Difference]: Without dead ends: 86 [2018-12-08 14:31:37,829 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-08 14:31:37,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-08 14:31:37,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2018-12-08 14:31:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-08 14:31:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2018-12-08 14:31:37,832 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 24 [2018-12-08 14:31:37,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:31:37,832 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2018-12-08 14:31:37,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 14:31:37,832 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2018-12-08 14:31:37,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 14:31:37,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:31:37,833 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-08 14:31:37,833 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-08 14:31:37,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:37,834 INFO L82 PathProgramCache]: Analyzing trace with hash -2009352802, now seen corresponding path program 1 times [2018-12-08 14:31:37,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:37,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:37,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:37,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:37,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:37,873 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-08 14:31:37,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:31:37,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 14:31:37,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 14:31:37,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 14:31:37,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-08 14:31:37,874 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 10 states. [2018-12-08 14:31:37,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:31:37,981 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-12-08 14:31:37,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 14:31:37,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-08 14:31:37,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:31:37,982 INFO L225 Difference]: With dead ends: 69 [2018-12-08 14:31:37,982 INFO L226 Difference]: Without dead ends: 51 [2018-12-08 14:31:37,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-12-08 14:31:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-08 14:31:37,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-12-08 14:31:37,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-08 14:31:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-12-08 14:31:37,984 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 25 [2018-12-08 14:31:37,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:31:37,984 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-12-08 14:31:37,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 14:31:37,984 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-12-08 14:31:37,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 14:31:37,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:31:37,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:31:37,984 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-08 14:31:37,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:37,985 INFO L82 PathProgramCache]: Analyzing trace with hash -689762273, now seen corresponding path program 1 times [2018-12-08 14:31:37,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:37,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:37,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:37,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:37,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:38,145 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-08 14:31:38,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:31:38,145 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/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-08 14:31:38,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:38,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:31:38,170 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-08 14:31:38,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:38,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:31:38,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-08 14:31:38,192 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-08 14:31:38,194 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-08 14:31:38,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:38,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:31:38,200 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-08 14:31:38,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-08 14:31:38,227 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-08 14:31:38,230 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-08 14:31:38,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:38,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:31:38,242 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-08 14:31:38,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-08 14:31:41,032 WARN L180 SmtUtils]: Spent 506.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-08 14:31:41,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-12-08 14:31:41,095 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 45 treesize of output 38 [2018-12-08 14:31:41,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:41,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-12-08 14:31:41,129 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:41,161 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 34 treesize of output 26 [2018-12-08 14:31:41,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:41,194 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 29 treesize of output 27 [2018-12-08 14:31:41,195 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-08 14:31:41,230 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 26 treesize of output 24 [2018-12-08 14:31:41,231 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-08 14:31:41,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2018-12-08 14:31:41,276 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-08 14:31:41,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2018-12-08 14:31:41,348 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-12-08 14:31:41,421 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 34 treesize of output 26 [2018-12-08 14:31:41,422 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:41,423 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 35 treesize of output 27 [2018-12-08 14:31:41,424 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:41,425 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 31 treesize of output 23 [2018-12-08 14:31:41,425 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:41,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-08 14:31:41,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 14:31:41,512 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-12-08 14:31:41,579 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-08 14:31:41,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:31:41,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2018-12-08 14:31:41,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-08 14:31:41,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-08 14:31:41,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2018-12-08 14:31:41,595 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 28 states. [2018-12-08 14:31:43,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:31:43,370 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-12-08 14:31:43,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 14:31:43,370 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-08 14:31:43,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:31:43,371 INFO L225 Difference]: With dead ends: 109 [2018-12-08 14:31:43,371 INFO L226 Difference]: Without dead ends: 109 [2018-12-08 14:31:43,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2018-12-08 14:31:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-08 14:31:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2018-12-08 14:31:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-08 14:31:43,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2018-12-08 14:31:43,373 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 27 [2018-12-08 14:31:43,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:31:43,374 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2018-12-08 14:31:43,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-08 14:31:43,374 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-12-08 14:31:43,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 14:31:43,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:31:43,374 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-08 14:31:43,374 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-08 14:31:43,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:43,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1181155673, now seen corresponding path program 2 times [2018-12-08 14:31:43,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:43,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:43,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:43,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:43,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:43,554 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-08 14:31:43,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:31:43,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/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-08 14:31:43,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 14:31:43,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 14:31:43,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 14:31:43,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:31:43,578 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-08 14:31:43,586 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-08 14:31:43,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 14:31:43,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 14:31:43,597 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-08 14:31:43,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-08 14:31:43,609 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-08 14:31:43,610 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-08 14:31:43,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:43,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:31:43,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:31:43,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-08 14:31:43,717 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-08 14:31:43,724 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-08 14:31:43,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 14:31:43,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 14:31:43,733 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-08 14:31:43,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-12-08 14:31:43,805 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-08 14:31:43,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:31:43,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-12-08 14:31:43,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 14:31:43,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 14:31:43,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-12-08 14:31:43,821 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 21 states. [2018-12-08 14:31:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:31:44,503 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2018-12-08 14:31:44,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 14:31:44,503 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-12-08 14:31:44,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:31:44,504 INFO L225 Difference]: With dead ends: 92 [2018-12-08 14:31:44,504 INFO L226 Difference]: Without dead ends: 90 [2018-12-08 14:31:44,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2018-12-08 14:31:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-08 14:31:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 44. [2018-12-08 14:31:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-08 14:31:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-12-08 14:31:44,506 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 30 [2018-12-08 14:31:44,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:31:44,507 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-12-08 14:31:44,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 14:31:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-12-08 14:31:44,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 14:31:44,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:31:44,507 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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-08 14:31:44,508 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-08 14:31:44,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:44,508 INFO L82 PathProgramCache]: Analyzing trace with hash 19179001, now seen corresponding path program 2 times [2018-12-08 14:31:44,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:44,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:44,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:44,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:31:44,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:31:44,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:31:44,667 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/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-08 14:31:44,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 14:31:44,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 14:31:44,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 14:31:44,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:31:44,707 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-08 14:31:44,710 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-08 14:31:44,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:44,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:31:44,721 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-08 14:31:44,722 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:44,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:31:44,727 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-12-08 14:31:44,744 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-08 14:31:44,746 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-08 14:31:44,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:44,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:31:44,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:31:44,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-12-08 14:31:44,788 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-08 14:31:44,790 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-08 14:31:44,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:44,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:31:44,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:31:44,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-12-08 14:31:45,149 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 46 treesize of output 40 [2018-12-08 14:31:45,156 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-08 14:31:45,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 14:31:45,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-12-08 14:31:45,166 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:45,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 14:31:45,190 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 2 xjuncts. [2018-12-08 14:31:45,191 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81 [2018-12-08 14:31:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:31:45,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:31:45,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 26 [2018-12-08 14:31:45,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-08 14:31:45,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-08 14:31:45,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2018-12-08 14:31:45,342 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 27 states. [2018-12-08 14:31:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:31:48,601 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-12-08 14:31:48,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-08 14:31:48,602 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 40 [2018-12-08 14:31:48,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:31:48,602 INFO L225 Difference]: With dead ends: 105 [2018-12-08 14:31:48,602 INFO L226 Difference]: Without dead ends: 105 [2018-12-08 14:31:48,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=778, Invalid=4052, Unknown=0, NotChecked=0, Total=4830 [2018-12-08 14:31:48,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-08 14:31:48,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 60. [2018-12-08 14:31:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-08 14:31:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-12-08 14:31:48,605 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 40 [2018-12-08 14:31:48,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:31:48,605 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-12-08 14:31:48,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-08 14:31:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-12-08 14:31:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 14:31:48,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:31:48,606 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:31:48,606 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-08 14:31:48,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:48,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1792606315, now seen corresponding path program 1 times [2018-12-08 14:31:48,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:48,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:48,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:48,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:31:48,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 14:31:48,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:31:48,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:31:48,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:48,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:31:48,838 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-08 14:31:48,840 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-08 14:31:48,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:48,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:31:48,849 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-08 14:31:48,849 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:48,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:31:48,852 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-08 14:31:48,867 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 15 treesize of output 12 [2018-12-08 14:31:48,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 14:31:48,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:48,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:31:48,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:31:48,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-08 14:31:48,893 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 28 treesize of output 29 [2018-12-08 14:31:48,894 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-08 14:31:48,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:48,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:31:48,903 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-08 14:31:48,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-08 14:31:52,520 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-08 14:31:52,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-12-08 14:31:52,577 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 48 treesize of output 46 [2018-12-08 14:31:52,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 14:31:52,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-12-08 14:31:52,621 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:52,658 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 38 treesize of output 31 [2018-12-08 14:31:52,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:52,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-12-08 14:31:52,659 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:52,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-12-08 14:31:52,706 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-12-08 14:31:52,766 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 40 treesize of output 30 [2018-12-08 14:31:52,767 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:52,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2018-12-08 14:31:52,826 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-12-08 14:31:52,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-12-08 14:31:52,888 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:52,889 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 31 treesize of output 21 [2018-12-08 14:31:52,889 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 14:31:52,950 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 32 treesize of output 30 [2018-12-08 14:31:52,950 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-08 14:31:52,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-08 14:31:53,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 14:31:53,032 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2018-12-08 14:31:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:31:53,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:31:53,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2018-12-08 14:31:53,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-08 14:31:53,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-08 14:31:53,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2018-12-08 14:31:53,146 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 33 states. [2018-12-08 14:31:53,442 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-12-08 14:31:55,752 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-12-08 14:31:57,343 WARN L180 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-12-08 14:31:58,482 WARN L180 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-12-08 14:32:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:32:00,269 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-12-08 14:32:00,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-08 14:32:00,269 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2018-12-08 14:32:00,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:32:00,269 INFO L225 Difference]: With dead ends: 84 [2018-12-08 14:32:00,269 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 14:32:00,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1160, Invalid=4242, Unknown=0, NotChecked=0, Total=5402 [2018-12-08 14:32:00,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 14:32:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 14:32:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 14:32:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 14:32:00,270 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2018-12-08 14:32:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:32:00,271 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:32:00,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-08 14:32:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 14:32:00,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 14:32:00,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 02:32:00 BoogieIcfgContainer [2018-12-08 14:32:00,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 14:32:00,274 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 14:32:00,274 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 14:32:00,274 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 14:32:00,274 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:31:35" (3/4) ... [2018-12-08 14:32:00,276 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 14:32:00,280 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 14:32:00,280 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrpbrk [2018-12-08 14:32:00,280 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-08 14:32:00,280 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-08 14:32:00,280 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 14:32:00,283 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-08 14:32:00,283 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-08 14:32:00,283 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-08 14:32:00,310 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_59d9d96d-368e-464a-bfd7-26e49c0d60ef/bin-2019/uautomizer/witness.graphml [2018-12-08 14:32:00,310 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 14:32:00,311 INFO L168 Benchmark]: Toolchain (without parser) took 25231.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.6 MB). Free memory was 951.7 MB in the beginning and 973.6 MB in the end (delta: -21.9 MB). Peak memory consumption was 206.7 MB. Max. memory is 11.5 GB. [2018-12-08 14:32:00,311 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:32:00,311 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-08 14:32:00,311 INFO L168 Benchmark]: Boogie Preprocessor took 27.53 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 14:32:00,311 INFO L168 Benchmark]: RCFGBuilder took 255.06 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2018-12-08 14:32:00,312 INFO L168 Benchmark]: TraceAbstraction took 24639.37 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 113.2 MB). Free memory was 1.1 GB in the beginning and 981.5 MB in the end (delta: 73.9 MB). Peak memory consumption was 187.2 MB. Max. memory is 11.5 GB. [2018-12-08 14:32:00,312 INFO L168 Benchmark]: Witness Printer took 36.54 ms. Allocated memory is still 1.3 GB. Free memory was 981.5 MB in the beginning and 973.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2018-12-08 14:32:00,313 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 270.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.53 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 255.06 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24639.37 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 113.2 MB). Free memory was 1.1 GB in the beginning and 981.5 MB in the end (delta: 73.9 MB). Peak memory consumption was 187.2 MB. Max. memory is 11.5 GB. * Witness Printer took 36.54 ms. Allocated memory is still 1.3 GB. Free memory was 981.5 MB in the beginning and 973.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. 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: 550]: 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: 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: 547]: 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: 550]: 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: 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: 567]: 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: 566]: 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, 24.6s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 512 SDtfs, 1703 SDslu, 1956 SDs, 0 SdLazy, 3220 SolverSat, 341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 443 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2703 ImplicationChecksByTransitivity, 19.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred 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, 17 MinimizatonAttempts, 177 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 535 ConstructedInterpolants, 106 QuantifiedInterpolants, 316055 SizeOfPredicates, 74 NumberOfNonLiveVariables, 850 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 22 InterpolantComputations, 12 PerfectInterpolantSequences, 74/173 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...