./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/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 440325a953e10d2173456ab8f8c8fc1313a6b958 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:19:55,414 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:19:55,415 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:19:55,424 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:19:55,424 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:19:55,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:19:55,425 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:19:55,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:19:55,428 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:19:55,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:19:55,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:19:55,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:19:55,430 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:19:55,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:19:55,432 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:19:55,433 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:19:55,433 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:19:55,434 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:19:55,436 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:19:55,437 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:19:55,438 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:19:55,439 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:19:55,441 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:19:55,441 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:19:55,441 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:19:55,442 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:19:55,442 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:19:55,443 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:19:55,444 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:19:55,445 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:19:55,445 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:19:55,445 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:19:55,446 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:19:55,446 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:19:55,446 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:19:55,447 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:19:55,448 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-10 12:19:55,458 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:19:55,458 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:19:55,459 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:19:55,459 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:19:55,459 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:19:55,459 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:19:55,460 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:19:55,460 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:19:55,460 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:19:55,460 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:19:55,460 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:19:55,460 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 12:19:55,460 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 12:19:55,461 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 12:19:55,461 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:19:55,461 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:19:55,461 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:19:55,461 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:19:55,461 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:19:55,461 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:19:55,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:19:55,462 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:19:55,462 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:19:55,462 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:19:55,462 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:19:55,462 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_605eafe9-9377-4345-9b98-647ea9d4be27/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 -> 440325a953e10d2173456ab8f8c8fc1313a6b958 [2018-11-10 12:19:55,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:19:55,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:19:55,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:19:55,506 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:19:55,506 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:19:55,507 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2018-11-10 12:19:55,548 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/data/fdf892ff7/e863541683f94174afeac0840a006ac1/FLAG032fc8c21 [2018-11-10 12:19:55,852 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:19:55,852 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2018-11-10 12:19:55,856 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/data/fdf892ff7/e863541683f94174afeac0840a006ac1/FLAG032fc8c21 [2018-11-10 12:19:55,864 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/data/fdf892ff7/e863541683f94174afeac0840a006ac1 [2018-11-10 12:19:55,866 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:19:55,867 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:19:55,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:19:55,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:19:55,871 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:19:55,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:19:55" (1/1) ... [2018-11-10 12:19:55,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61258a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:55, skipping insertion in model container [2018-11-10 12:19:55,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:19:55" (1/1) ... [2018-11-10 12:19:55,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:19:55,895 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:19:56,010 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:19:56,022 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:19:56,038 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:19:56,052 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:19:56,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:56 WrapperNode [2018-11-10 12:19:56,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:19:56,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:19:56,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:19:56,053 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:19:56,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:56" (1/1) ... [2018-11-10 12:19:56,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:56" (1/1) ... [2018-11-10 12:19:56,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:56" (1/1) ... [2018-11-10 12:19:56,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:56" (1/1) ... [2018-11-10 12:19:56,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:56" (1/1) ... [2018-11-10 12:19:56,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:56" (1/1) ... [2018-11-10 12:19:56,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:56" (1/1) ... [2018-11-10 12:19:56,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:19:56,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:19:56,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:19:56,082 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:19:56,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/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-11-10 12:19:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:19:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:19:56,168 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-11-10 12:19:56,168 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-11-10 12:19:56,168 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2018-11-10 12:19:56,168 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2018-11-10 12:19:56,168 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:19:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2018-11-10 12:19:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-11-10 12:19:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:19:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-11-10 12:19:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:19:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2018-11-10 12:19:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 12:19:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 12:19:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2018-11-10 12:19:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:19:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:19:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 12:19:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:19:56,457 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:19:56,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:19:56 BoogieIcfgContainer [2018-11-10 12:19:56,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:19:56,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:19:56,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:19:56,461 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:19:56,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:19:55" (1/3) ... [2018-11-10 12:19:56,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a7dbfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:19:56, skipping insertion in model container [2018-11-10 12:19:56,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:56" (2/3) ... [2018-11-10 12:19:56,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a7dbfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:19:56, skipping insertion in model container [2018-11-10 12:19:56,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:19:56" (3/3) ... [2018-11-10 12:19:56,463 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_false-valid-deref.c [2018-11-10 12:19:56,469 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:19:56,473 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-11-10 12:19:56,482 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-11-10 12:19:56,499 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:19:56,499 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:19:56,499 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 12:19:56,499 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:19:56,499 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:19:56,499 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:19:56,499 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:19:56,500 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:19:56,500 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:19:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-11-10 12:19:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 12:19:56,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:56,519 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:56,520 INFO L424 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:19:56,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:56,525 INFO L82 PathProgramCache]: Analyzing trace with hash 632035808, now seen corresponding path program 1 times [2018-11-10 12:19:56,526 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:56,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:56,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:56,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:56,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:19:56,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:19:56,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:19:56,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:19:56,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:19:56,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:19:56,774 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 4 states. [2018-11-10 12:19:56,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:56,896 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-10 12:19:56,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:19:56,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-11-10 12:19:56,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:56,903 INFO L225 Difference]: With dead ends: 113 [2018-11-10 12:19:56,903 INFO L226 Difference]: Without dead ends: 110 [2018-11-10 12:19:56,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:19:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-10 12:19:56,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-11-10 12:19:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-10 12:19:56,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2018-11-10 12:19:56,930 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 48 [2018-11-10 12:19:56,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:56,930 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-11-10 12:19:56,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:19:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-11-10 12:19:56,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 12:19:56,931 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:56,931 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:56,932 INFO L424 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:19:56,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:56,932 INFO L82 PathProgramCache]: Analyzing trace with hash 632035809, now seen corresponding path program 1 times [2018-11-10 12:19:56,932 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:56,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:56,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:56,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:56,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:19:57,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:19:57,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:19:57,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:19:57,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:19:57,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:19:57,099 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 6 states. [2018-11-10 12:19:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:57,247 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-11-10 12:19:57,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:19:57,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-11-10 12:19:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:57,249 INFO L225 Difference]: With dead ends: 114 [2018-11-10 12:19:57,249 INFO L226 Difference]: Without dead ends: 114 [2018-11-10 12:19:57,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:19:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-10 12:19:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-11-10 12:19:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-10 12:19:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-11-10 12:19:57,256 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 48 [2018-11-10 12:19:57,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:57,256 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-11-10 12:19:57,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:19:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-10 12:19:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 12:19:57,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:57,257 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:57,257 INFO L424 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:19:57,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:57,258 INFO L82 PathProgramCache]: Analyzing trace with hash -595119304, now seen corresponding path program 1 times [2018-11-10 12:19:57,258 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:57,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:57,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:57,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:57,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:19:57,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:19:57,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:19:57,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:19:57,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:19:57,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:19:57,445 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 8 states. [2018-11-10 12:19:57,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:57,645 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-10 12:19:57,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:19:57,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-11-10 12:19:57,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:57,647 INFO L225 Difference]: With dead ends: 113 [2018-11-10 12:19:57,647 INFO L226 Difference]: Without dead ends: 113 [2018-11-10 12:19:57,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:19:57,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-10 12:19:57,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-11-10 12:19:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-10 12:19:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-11-10 12:19:57,654 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 52 [2018-11-10 12:19:57,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:57,654 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-11-10 12:19:57,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:19:57,654 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-11-10 12:19:57,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 12:19:57,655 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:57,655 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:57,656 INFO L424 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:19:57,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:57,656 INFO L82 PathProgramCache]: Analyzing trace with hash 357877774, now seen corresponding path program 1 times [2018-11-10 12:19:57,656 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:57,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:57,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:57,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:57,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:19:57,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:19:57,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:19:57,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:19:57,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:19:57,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:19:57,715 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 6 states. [2018-11-10 12:19:57,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:57,829 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-11-10 12:19:57,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:19:57,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-11-10 12:19:57,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:57,831 INFO L225 Difference]: With dead ends: 110 [2018-11-10 12:19:57,831 INFO L226 Difference]: Without dead ends: 110 [2018-11-10 12:19:57,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:19:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-10 12:19:57,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-11-10 12:19:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-10 12:19:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2018-11-10 12:19:57,838 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 58 [2018-11-10 12:19:57,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:57,838 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-11-10 12:19:57,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:19:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-11-10 12:19:57,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 12:19:57,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:57,839 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:57,840 INFO L424 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:19:57,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:57,840 INFO L82 PathProgramCache]: Analyzing trace with hash 357877775, now seen corresponding path program 1 times [2018-11-10 12:19:57,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:57,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:57,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:57,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:57,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:19:57,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:19:57,886 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/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-11-10 12:19:57,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:57,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:19:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:19:58,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:19:58,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 12:19:58,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:19:58,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:19:58,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:19:58,016 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 5 states. [2018-11-10 12:19:58,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:58,030 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2018-11-10 12:19:58,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:19:58,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-10 12:19:58,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:58,031 INFO L225 Difference]: With dead ends: 116 [2018-11-10 12:19:58,032 INFO L226 Difference]: Without dead ends: 116 [2018-11-10 12:19:58,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:19:58,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-10 12:19:58,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-11-10 12:19:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-10 12:19:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2018-11-10 12:19:58,038 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 58 [2018-11-10 12:19:58,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:58,039 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2018-11-10 12:19:58,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:19:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2018-11-10 12:19:58,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 12:19:58,040 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:58,040 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:58,040 INFO L424 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:19:58,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:58,041 INFO L82 PathProgramCache]: Analyzing trace with hash 631070886, now seen corresponding path program 2 times [2018-11-10 12:19:58,041 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:58,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:58,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:58,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:58,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:19:58,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:19:58,090 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/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-11-10 12:19:58,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:19:58,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 12:19:58,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:19:58,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:19:58,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 12:19:58,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:19:58,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 12:19:58,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:19:58,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:19:58,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 12:19:58,243 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:19:58,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:19:58,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 12:19:58,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:19:58,261 INFO L477 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-11-10 12:19:58,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:19:58,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:19:58,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:28 [2018-11-10 12:19:58,338 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:19:58,340 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:19:58,341 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:19:58,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 12:19:58,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:19:58,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-11-10 12:19:58,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:19:58,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:19:58,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:31 [2018-11-10 12:19:58,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 12:19:58,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:19:58,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2018-11-10 12:19:58,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 12:19:58,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 12:19:58,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:19:58,576 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand 12 states. [2018-11-10 12:19:59,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:59,026 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-10 12:19:59,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 12:19:59,027 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-11-10 12:19:59,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:59,027 INFO L225 Difference]: With dead ends: 121 [2018-11-10 12:19:59,028 INFO L226 Difference]: Without dead ends: 121 [2018-11-10 12:19:59,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-11-10 12:19:59,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-10 12:19:59,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-10 12:19:59,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-10 12:19:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-11-10 12:19:59,033 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 62 [2018-11-10 12:19:59,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:59,034 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-11-10 12:19:59,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 12:19:59,034 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-10 12:19:59,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 12:19:59,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:59,035 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:59,035 INFO L424 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:19:59,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:59,035 INFO L82 PathProgramCache]: Analyzing trace with hash -854531546, now seen corresponding path program 1 times [2018-11-10 12:19:59,035 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:59,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:59,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:59,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:19:59,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:19:59,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:19:59,087 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/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-11-10 12:19:59,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:59,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:19:59,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:19:59,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:19:59,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 12:19:59,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:19:59,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:19:59,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:19:59,170 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 7 states. [2018-11-10 12:19:59,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:59,185 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-10 12:19:59,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:19:59,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-11-10 12:19:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:59,186 INFO L225 Difference]: With dead ends: 125 [2018-11-10 12:19:59,186 INFO L226 Difference]: Without dead ends: 125 [2018-11-10 12:19:59,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:19:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-10 12:19:59,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-11-10 12:19:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-10 12:19:59,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2018-11-10 12:19:59,190 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 67 [2018-11-10 12:19:59,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:59,191 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2018-11-10 12:19:59,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:19:59,191 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-10 12:19:59,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 12:19:59,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:59,192 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:59,192 INFO L424 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:19:59,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:59,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1078264687, now seen corresponding path program 2 times [2018-11-10 12:19:59,192 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:59,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:59,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:59,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:59,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:19:59,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:19:59,265 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/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-11-10 12:19:59,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:19:59,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 12:19:59,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:19:59,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:19:59,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 12:19:59,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:19:59,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:19:59,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 12:19:59,318 INFO L477 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 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 12:19:59,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:19:59,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:19:59,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-10 12:19:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 12:19:59,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:19:59,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2018-11-10 12:19:59,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:19:59,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:19:59,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:19:59,351 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 8 states. [2018-11-10 12:19:59,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:59,438 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-10 12:19:59,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:19:59,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-11-10 12:19:59,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:59,439 INFO L225 Difference]: With dead ends: 128 [2018-11-10 12:19:59,439 INFO L226 Difference]: Without dead ends: 128 [2018-11-10 12:19:59,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:19:59,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-10 12:19:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-10 12:19:59,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-10 12:19:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2018-11-10 12:19:59,444 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 71 [2018-11-10 12:19:59,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:59,444 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2018-11-10 12:19:59,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:19:59,444 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-10 12:19:59,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-10 12:19:59,445 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:59,445 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:59,445 INFO L424 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:19:59,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:59,446 INFO L82 PathProgramCache]: Analyzing trace with hash -830121927, now seen corresponding path program 1 times [2018-11-10 12:19:59,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:59,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:59,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:59,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:19:59,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:59,494 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:19:59,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:19:59,495 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/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-11-10 12:19:59,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:59,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:19:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:19:59,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:19:59,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-10 12:19:59,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:19:59,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:19:59,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:19:59,568 INFO L87 Difference]: Start difference. First operand 126 states and 130 transitions. Second operand 9 states. [2018-11-10 12:19:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:59,596 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-11-10 12:19:59,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:19:59,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2018-11-10 12:19:59,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:59,598 INFO L225 Difference]: With dead ends: 132 [2018-11-10 12:19:59,599 INFO L226 Difference]: Without dead ends: 132 [2018-11-10 12:19:59,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:19:59,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-10 12:19:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-11-10 12:19:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 12:19:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2018-11-10 12:19:59,603 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 75 [2018-11-10 12:19:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:59,603 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2018-11-10 12:19:59,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:19:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2018-11-10 12:19:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 12:19:59,604 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:59,605 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:59,605 INFO L424 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:19:59,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:59,605 INFO L82 PathProgramCache]: Analyzing trace with hash -410247038, now seen corresponding path program 2 times [2018-11-10 12:19:59,605 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:59,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:59,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:59,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:59,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:59,673 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:19:59,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:19:59,674 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:19:59,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:19:59,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 12:19:59,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:19:59,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:19:59,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 12:19:59,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:19:59,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 12:19:59,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:19:59,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:19:59,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 12:19:59,744 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:19:59,747 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:19:59,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 12:19:59,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:19:59,754 INFO L477 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-11-10 12:19:59,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:19:59,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:19:59,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-11-10 12:19:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-10 12:19:59,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:19:59,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2018-11-10 12:19:59,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 12:19:59,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:19:59,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:19:59,883 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand 13 states. [2018-11-10 12:20:00,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:00,175 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-11-10 12:20:00,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 12:20:00,175 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-11-10 12:20:00,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:00,176 INFO L225 Difference]: With dead ends: 135 [2018-11-10 12:20:00,176 INFO L226 Difference]: Without dead ends: 135 [2018-11-10 12:20:00,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-11-10 12:20:00,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-10 12:20:00,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-11-10 12:20:00,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-10 12:20:00,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2018-11-10 12:20:00,179 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 79 [2018-11-10 12:20:00,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:00,179 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2018-11-10 12:20:00,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 12:20:00,179 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-10 12:20:00,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 12:20:00,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:00,180 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:00,180 INFO L424 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:00,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:00,180 INFO L82 PathProgramCache]: Analyzing trace with hash -577435457, now seen corresponding path program 1 times [2018-11-10 12:20:00,180 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:00,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:00,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:00,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:00,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 12:20:00,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:00,251 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:00,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:00,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 12:20:00,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:20:00,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-10 12:20:00,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:20:00,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:20:00,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:20:00,318 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 11 states. [2018-11-10 12:20:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:00,345 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-11-10 12:20:00,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:20:00,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-11-10 12:20:00,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:00,346 INFO L225 Difference]: With dead ends: 139 [2018-11-10 12:20:00,346 INFO L226 Difference]: Without dead ends: 139 [2018-11-10 12:20:00,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:20:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-10 12:20:00,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-11-10 12:20:00,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-10 12:20:00,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2018-11-10 12:20:00,348 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 96 [2018-11-10 12:20:00,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:00,348 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2018-11-10 12:20:00,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:20:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-10 12:20:00,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 12:20:00,349 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:00,349 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:00,350 INFO L424 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:00,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:00,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1707247594, now seen corresponding path program 2 times [2018-11-10 12:20:00,350 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:00,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:00,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:00,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:00,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 12:20:00,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:00,420 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:00,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:20:00,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 12:20:00,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:20:00,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:00,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 12:20:00,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:20:00,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:20:00,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 12:20:00,467 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:20:00,468 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:20:00,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 12:20:00,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:20:00,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:20:00,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-11-10 12:20:00,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-10 12:20:00,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:20:00,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:20:00,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-11-10 12:20:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-10 12:20:00,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:20:00,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2018-11-10 12:20:00,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 12:20:00,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 12:20:00,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-11-10 12:20:00,606 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 16 states. [2018-11-10 12:20:00,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:00,892 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2018-11-10 12:20:00,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 12:20:00,893 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 100 [2018-11-10 12:20:00,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:00,894 INFO L225 Difference]: With dead ends: 142 [2018-11-10 12:20:00,894 INFO L226 Difference]: Without dead ends: 142 [2018-11-10 12:20:00,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-11-10 12:20:00,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-10 12:20:00,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-11-10 12:20:00,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-10 12:20:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-11-10 12:20:00,897 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 100 [2018-11-10 12:20:00,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:00,897 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-11-10 12:20:00,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 12:20:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-11-10 12:20:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 12:20:00,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:00,898 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:00,898 INFO L424 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:00,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:00,899 INFO L82 PathProgramCache]: Analyzing trace with hash -471833618, now seen corresponding path program 1 times [2018-11-10 12:20:00,899 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:00,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:00,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:00,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:00,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 12:20:00,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:00,983 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:00,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:01,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 12:20:01,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:20:01,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-10 12:20:01,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 12:20:01,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:20:01,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:20:01,062 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 13 states. [2018-11-10 12:20:01,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:01,105 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2018-11-10 12:20:01,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 12:20:01,106 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2018-11-10 12:20:01,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:01,107 INFO L225 Difference]: With dead ends: 144 [2018-11-10 12:20:01,107 INFO L226 Difference]: Without dead ends: 144 [2018-11-10 12:20:01,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:20:01,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-10 12:20:01,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-11-10 12:20:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-10 12:20:01,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2018-11-10 12:20:01,111 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 104 [2018-11-10 12:20:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:01,111 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2018-11-10 12:20:01,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 12:20:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2018-11-10 12:20:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 12:20:01,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:01,112 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:01,113 INFO L424 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:01,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:01,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2014606267, now seen corresponding path program 2 times [2018-11-10 12:20:01,113 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:01,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:01,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:01,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:01,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-10 12:20:01,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:01,155 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:01,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:20:01,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 12:20:01,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:20:01,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:01,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 12:20:01,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:20:01,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 12:20:01,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:20:01,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:20:01,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 12:20:01,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:20:01,240 INFO L477 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-11-10 12:20:01,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:20:01,261 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:20:01,262 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:20:01,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 12:20:01,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:20:01,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:20:01,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-11-10 12:20:01,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-10 12:20:01,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:20:01,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:20:01,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:23 [2018-11-10 12:20:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-11-10 12:20:01,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:20:01,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 11 [2018-11-10 12:20:01,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:20:01,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:20:01,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:20:01,520 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand 11 states. [2018-11-10 12:20:01,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:01,809 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-11-10 12:20:01,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 12:20:01,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 108 [2018-11-10 12:20:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:01,810 INFO L225 Difference]: With dead ends: 155 [2018-11-10 12:20:01,810 INFO L226 Difference]: Without dead ends: 155 [2018-11-10 12:20:01,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-11-10 12:20:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-10 12:20:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2018-11-10 12:20:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 12:20:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2018-11-10 12:20:01,813 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 108 [2018-11-10 12:20:01,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:01,813 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2018-11-10 12:20:01,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:20:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2018-11-10 12:20:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 12:20:01,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:01,814 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:01,814 INFO L424 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:01,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:01,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2079049901, now seen corresponding path program 1 times [2018-11-10 12:20:01,814 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:01,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:01,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:01,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:01,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-10 12:20:01,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:01,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:20:01,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:01,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:01,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:01,860 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 3 states. [2018-11-10 12:20:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:01,876 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-11-10 12:20:01,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:01,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-11-10 12:20:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:01,877 INFO L225 Difference]: With dead ends: 150 [2018-11-10 12:20:01,877 INFO L226 Difference]: Without dead ends: 150 [2018-11-10 12:20:01,877 INFO L605 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-11-10 12:20:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-10 12:20:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-11-10 12:20:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-10 12:20:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2018-11-10 12:20:01,881 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 115 [2018-11-10 12:20:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:01,881 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2018-11-10 12:20:01,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2018-11-10 12:20:01,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 12:20:01,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:01,882 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:01,882 INFO L424 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:01,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:01,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2079049902, now seen corresponding path program 1 times [2018-11-10 12:20:01,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:01,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:01,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:01,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:01,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-10 12:20:01,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:01,938 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:01,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:01,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:01,998 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-10 12:20:02,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:20:02,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 12:20:02,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:20:02,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:20:02,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:20:02,025 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand 6 states. [2018-11-10 12:20:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:02,043 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2018-11-10 12:20:02,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:20:02,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2018-11-10 12:20:02,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:02,044 INFO L225 Difference]: With dead ends: 160 [2018-11-10 12:20:02,044 INFO L226 Difference]: Without dead ends: 160 [2018-11-10 12:20:02,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:20:02,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-10 12:20:02,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2018-11-10 12:20:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-10 12:20:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 160 transitions. [2018-11-10 12:20:02,047 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 160 transitions. Word has length 115 [2018-11-10 12:20:02,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:02,048 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 160 transitions. [2018-11-10 12:20:02,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:20:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2018-11-10 12:20:02,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 12:20:02,048 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:02,048 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:02,049 INFO L424 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:02,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:02,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2020717224, now seen corresponding path program 2 times [2018-11-10 12:20:02,049 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:02,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:02,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:02,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:02,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:02,112 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-10 12:20:02,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:02,112 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:02,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:20:02,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 12:20:02,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:20:02,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:02,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 12:20:02,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:20:02,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:20:02,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 12:20:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-11-10 12:20:02,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:20:02,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2018-11-10 12:20:02,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:20:02,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:20:02,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:20:02,233 INFO L87 Difference]: Start difference. First operand 156 states and 160 transitions. Second operand 9 states. [2018-11-10 12:20:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:02,286 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2018-11-10 12:20:02,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:20:02,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2018-11-10 12:20:02,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:02,288 INFO L225 Difference]: With dead ends: 165 [2018-11-10 12:20:02,288 INFO L226 Difference]: Without dead ends: 165 [2018-11-10 12:20:02,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:20:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-10 12:20:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2018-11-10 12:20:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-10 12:20:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2018-11-10 12:20:02,296 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 121 [2018-11-10 12:20:02,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:02,297 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2018-11-10 12:20:02,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:20:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2018-11-10 12:20:02,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 12:20:02,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:02,298 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:02,298 INFO L424 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:02,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:02,298 INFO L82 PathProgramCache]: Analyzing trace with hash 860056674, now seen corresponding path program 1 times [2018-11-10 12:20:02,298 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:02,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:02,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:02,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:02,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-11-10 12:20:02,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:02,363 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:02,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:02,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-11-10 12:20:02,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:20:02,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 12:20:02,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:20:02,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:20:02,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:20:02,462 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand 8 states. [2018-11-10 12:20:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:02,496 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2018-11-10 12:20:02,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:20:02,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 140 [2018-11-10 12:20:02,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:02,500 INFO L225 Difference]: With dead ends: 171 [2018-11-10 12:20:02,500 INFO L226 Difference]: Without dead ends: 171 [2018-11-10 12:20:02,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:20:02,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-10 12:20:02,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2018-11-10 12:20:02,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-10 12:20:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2018-11-10 12:20:02,503 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 140 [2018-11-10 12:20:02,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:02,504 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2018-11-10 12:20:02,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:20:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2018-11-10 12:20:02,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 12:20:02,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:02,505 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:02,505 INFO L424 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:02,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:02,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1796119288, now seen corresponding path program 2 times [2018-11-10 12:20:02,506 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:02,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:02,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:02,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:02,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-11-10 12:20:02,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:02,574 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:02,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:20:03,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:20:03,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:20:03,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-10 12:20:03,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:20:03,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2018-11-10 12:20:03,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 12:20:03,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:20:03,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:20:03,180 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand 10 states. [2018-11-10 12:20:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:03,223 INFO L93 Difference]: Finished difference Result 187 states and 191 transitions. [2018-11-10 12:20:03,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:20:03,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2018-11-10 12:20:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:03,224 INFO L225 Difference]: With dead ends: 187 [2018-11-10 12:20:03,224 INFO L226 Difference]: Without dead ends: 187 [2018-11-10 12:20:03,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:20:03,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-10 12:20:03,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 179. [2018-11-10 12:20:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-10 12:20:03,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 183 transitions. [2018-11-10 12:20:03,233 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 183 transitions. Word has length 146 [2018-11-10 12:20:03,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:03,234 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 183 transitions. [2018-11-10 12:20:03,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 12:20:03,234 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 183 transitions. [2018-11-10 12:20:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 12:20:03,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:03,235 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 7, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:03,235 INFO L424 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:03,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:03,235 INFO L82 PathProgramCache]: Analyzing trace with hash 165943748, now seen corresponding path program 3 times [2018-11-10 12:20:03,235 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:03,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:03,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:03,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:03,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-10 12:20:03,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:03,304 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:03,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:20:03,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 12:20:03,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:20:03,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-11-10 12:20:04,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:20:04,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2018-11-10 12:20:04,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 12:20:04,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 12:20:04,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:20:04,014 INFO L87 Difference]: Start difference. First operand 179 states and 183 transitions. Second operand 12 states. [2018-11-10 12:20:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:04,060 INFO L93 Difference]: Finished difference Result 199 states and 203 transitions. [2018-11-10 12:20:04,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 12:20:04,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 158 [2018-11-10 12:20:04,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:04,061 INFO L225 Difference]: With dead ends: 199 [2018-11-10 12:20:04,061 INFO L226 Difference]: Without dead ends: 199 [2018-11-10 12:20:04,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:20:04,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-10 12:20:04,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 191. [2018-11-10 12:20:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-10 12:20:04,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 195 transitions. [2018-11-10 12:20:04,065 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 195 transitions. Word has length 158 [2018-11-10 12:20:04,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:04,065 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 195 transitions. [2018-11-10 12:20:04,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 12:20:04,066 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 195 transitions. [2018-11-10 12:20:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 12:20:04,066 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:04,067 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 8, 7, 7, 7, 7, 7, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:04,067 INFO L424 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:04,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:04,067 INFO L82 PathProgramCache]: Analyzing trace with hash 726441616, now seen corresponding path program 4 times [2018-11-10 12:20:04,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:04,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:04,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:04,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:04,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-11-10 12:20:04,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:04,156 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:04,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 12:20:04,204 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 12:20:04,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:20:04,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-11-10 12:20:04,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:20:04,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-10 12:20:04,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:20:04,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:20:04,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:20:04,257 INFO L87 Difference]: Start difference. First operand 191 states and 195 transitions. Second operand 11 states. [2018-11-10 12:20:04,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:04,305 INFO L93 Difference]: Finished difference Result 201 states and 205 transitions. [2018-11-10 12:20:04,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:20:04,306 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 170 [2018-11-10 12:20:04,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:04,307 INFO L225 Difference]: With dead ends: 201 [2018-11-10 12:20:04,307 INFO L226 Difference]: Without dead ends: 201 [2018-11-10 12:20:04,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:20:04,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-10 12:20:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2018-11-10 12:20:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-10 12:20:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 201 transitions. [2018-11-10 12:20:04,313 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 201 transitions. Word has length 170 [2018-11-10 12:20:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:04,313 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 201 transitions. [2018-11-10 12:20:04,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:20:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 201 transitions. [2018-11-10 12:20:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 12:20:04,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:04,314 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:04,314 INFO L424 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:04,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:04,314 INFO L82 PathProgramCache]: Analyzing trace with hash 37266086, now seen corresponding path program 5 times [2018-11-10 12:20:04,314 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:04,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:04,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:04,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:04,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-11-10 12:20:04,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:04,424 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:04,432 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 12:20:05,734 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-10 12:20:05,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:20:05,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:05,774 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2018-11-10 12:20:05,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:20:05,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2018-11-10 12:20:05,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 12:20:05,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 12:20:05,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-11-10 12:20:05,791 INFO L87 Difference]: Start difference. First operand 197 states and 201 transitions. Second operand 15 states. [2018-11-10 12:20:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:05,841 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2018-11-10 12:20:05,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 12:20:05,841 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 176 [2018-11-10 12:20:05,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:05,842 INFO L225 Difference]: With dead ends: 217 [2018-11-10 12:20:05,842 INFO L226 Difference]: Without dead ends: 217 [2018-11-10 12:20:05,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-11-10 12:20:05,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-10 12:20:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 209. [2018-11-10 12:20:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-10 12:20:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 213 transitions. [2018-11-10 12:20:05,845 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 213 transitions. Word has length 176 [2018-11-10 12:20:05,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:05,845 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 213 transitions. [2018-11-10 12:20:05,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 12:20:05,845 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 213 transitions. [2018-11-10 12:20:05,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 12:20:05,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:05,845 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:05,846 INFO L424 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:05,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:05,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1900692366, now seen corresponding path program 6 times [2018-11-10 12:20:05,846 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:05,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:05,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:05,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:05,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-11-10 12:20:05,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:05,947 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:05,953 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 12:20:10,968 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-10 12:20:10,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:20:10,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 50 proven. 44 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2018-11-10 12:20:11,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:20:11,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-11-10 12:20:11,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-10 12:20:11,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 12:20:11,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2018-11-10 12:20:11,232 INFO L87 Difference]: Start difference. First operand 209 states and 213 transitions. Second operand 25 states. [2018-11-10 12:20:11,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:11,575 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2018-11-10 12:20:11,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 12:20:11,575 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 188 [2018-11-10 12:20:11,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:11,576 INFO L225 Difference]: With dead ends: 225 [2018-11-10 12:20:11,576 INFO L226 Difference]: Without dead ends: 225 [2018-11-10 12:20:11,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=277, Invalid=913, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 12:20:11,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-10 12:20:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 221. [2018-11-10 12:20:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-10 12:20:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 225 transitions. [2018-11-10 12:20:11,579 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 225 transitions. Word has length 188 [2018-11-10 12:20:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:11,579 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 225 transitions. [2018-11-10 12:20:11,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-10 12:20:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2018-11-10 12:20:11,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-10 12:20:11,580 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:11,580 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:11,580 INFO L424 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:11,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:11,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1018256446, now seen corresponding path program 7 times [2018-11-10 12:20:11,581 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:11,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:11,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:11,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:11,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-10 12:20:11,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:11,652 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:11,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:11,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-10 12:20:11,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:20:11,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-10 12:20:11,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:20:11,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:20:11,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:20:11,757 INFO L87 Difference]: Start difference. First operand 221 states and 225 transitions. Second operand 9 states. [2018-11-10 12:20:11,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:11,782 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2018-11-10 12:20:11,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:20:11,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2018-11-10 12:20:11,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:11,783 INFO L225 Difference]: With dead ends: 231 [2018-11-10 12:20:11,784 INFO L226 Difference]: Without dead ends: 231 [2018-11-10 12:20:11,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:20:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-10 12:20:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 227. [2018-11-10 12:20:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-10 12:20:11,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions. [2018-11-10 12:20:11,787 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 200 [2018-11-10 12:20:11,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:11,788 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions. [2018-11-10 12:20:11,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:20:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2018-11-10 12:20:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-10 12:20:11,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:11,789 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:11,789 INFO L424 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:11,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:11,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2020233460, now seen corresponding path program 8 times [2018-11-10 12:20:11,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:11,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:11,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:11,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:11,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-10 12:20:11,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:11,916 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:11,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:20:12,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:20:12,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:20:12,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-10 12:20:12,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:20:12,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-10 12:20:12,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 12:20:12,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:20:12,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:20:12,314 INFO L87 Difference]: Start difference. First operand 227 states and 231 transitions. Second operand 10 states. [2018-11-10 12:20:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:12,340 INFO L93 Difference]: Finished difference Result 237 states and 241 transitions. [2018-11-10 12:20:12,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:20:12,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 206 [2018-11-10 12:20:12,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:12,341 INFO L225 Difference]: With dead ends: 237 [2018-11-10 12:20:12,341 INFO L226 Difference]: Without dead ends: 237 [2018-11-10 12:20:12,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:20:12,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-10 12:20:12,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2018-11-10 12:20:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-10 12:20:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 237 transitions. [2018-11-10 12:20:12,344 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 237 transitions. Word has length 206 [2018-11-10 12:20:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:12,345 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 237 transitions. [2018-11-10 12:20:12,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 12:20:12,345 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 237 transitions. [2018-11-10 12:20:12,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-10 12:20:12,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:12,346 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:12,346 INFO L424 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:12,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:12,346 INFO L82 PathProgramCache]: Analyzing trace with hash 373974314, now seen corresponding path program 9 times [2018-11-10 12:20:12,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:12,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:12,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:12,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-10 12:20:12,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:12,439 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:12,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:20:16,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-10 12:20:16,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:20:16,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-10 12:20:16,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:20:16,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-10 12:20:16,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:20:16,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:20:16,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:20:16,926 INFO L87 Difference]: Start difference. First operand 233 states and 237 transitions. Second operand 11 states. [2018-11-10 12:20:16,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:16,955 INFO L93 Difference]: Finished difference Result 243 states and 247 transitions. [2018-11-10 12:20:16,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:20:16,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 212 [2018-11-10 12:20:16,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:16,957 INFO L225 Difference]: With dead ends: 243 [2018-11-10 12:20:16,957 INFO L226 Difference]: Without dead ends: 243 [2018-11-10 12:20:16,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:20:16,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-10 12:20:16,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2018-11-10 12:20:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-10 12:20:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 243 transitions. [2018-11-10 12:20:16,960 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 243 transitions. Word has length 212 [2018-11-10 12:20:16,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:16,961 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 243 transitions. [2018-11-10 12:20:16,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:20:16,961 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 243 transitions. [2018-11-10 12:20:16,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-10 12:20:16,962 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:16,962 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:16,962 INFO L424 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:16,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:16,962 INFO L82 PathProgramCache]: Analyzing trace with hash -245630752, now seen corresponding path program 10 times [2018-11-10 12:20:16,962 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:16,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:16,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:16,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:16,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:17,040 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-10 12:20:17,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:17,040 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:17,046 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 12:20:17,089 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 12:20:17,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:20:17,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-10 12:20:17,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:20:17,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-10 12:20:17,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 12:20:17,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 12:20:17,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:20:17,144 INFO L87 Difference]: Start difference. First operand 239 states and 243 transitions. Second operand 12 states. [2018-11-10 12:20:17,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:17,177 INFO L93 Difference]: Finished difference Result 249 states and 253 transitions. [2018-11-10 12:20:17,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:20:17,178 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 218 [2018-11-10 12:20:17,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:17,179 INFO L225 Difference]: With dead ends: 249 [2018-11-10 12:20:17,179 INFO L226 Difference]: Without dead ends: 249 [2018-11-10 12:20:17,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:20:17,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-10 12:20:17,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 245. [2018-11-10 12:20:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-10 12:20:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 249 transitions. [2018-11-10 12:20:17,182 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 249 transitions. Word has length 218 [2018-11-10 12:20:17,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:17,183 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 249 transitions. [2018-11-10 12:20:17,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 12:20:17,185 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 249 transitions. [2018-11-10 12:20:17,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-10 12:20:17,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:17,186 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:17,186 INFO L424 AbstractCegarLoop]: === Iteration 28 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:17,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:17,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1264675862, now seen corresponding path program 11 times [2018-11-10 12:20:17,186 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:17,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:17,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:17,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:17,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:17,278 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-10 12:20:17,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:20:17,279 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:20:17,286 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 12:20:46,572 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-10 12:20:46,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:20:46,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:20:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-10 12:20:46,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:20:46,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-10 12:20:46,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 12:20:46,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:20:46,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:20:46,634 INFO L87 Difference]: Start difference. First operand 245 states and 249 transitions. Second operand 13 states. [2018-11-10 12:20:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:46,679 INFO L93 Difference]: Finished difference Result 251 states and 255 transitions. [2018-11-10 12:20:46,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 12:20:46,679 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 224 [2018-11-10 12:20:46,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:46,680 INFO L225 Difference]: With dead ends: 251 [2018-11-10 12:20:46,680 INFO L226 Difference]: Without dead ends: 251 [2018-11-10 12:20:46,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:20:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-10 12:20:46,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-11-10 12:20:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-10 12:20:46,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 255 transitions. [2018-11-10 12:20:46,684 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 255 transitions. Word has length 224 [2018-11-10 12:20:46,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:46,684 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 255 transitions. [2018-11-10 12:20:46,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 12:20:46,684 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 255 transitions. [2018-11-10 12:20:46,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-10 12:20:46,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:46,686 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:46,686 INFO L424 AbstractCegarLoop]: === Iteration 29 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-10 12:20:46,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:46,686 INFO L82 PathProgramCache]: Analyzing trace with hash -489349428, now seen corresponding path program 12 times [2018-11-10 12:20:46,686 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:46,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:46,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:46,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:20:46,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:20:47,226 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 12:20:47,261 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,262 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,262 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,263 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,263 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,263 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,263 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,263 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,264 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,264 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,264 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,264 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,264 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,264 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,265 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,265 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,265 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,265 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,265 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,266 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,266 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,266 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,266 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,266 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:20:47 BoogieIcfgContainer [2018-11-10 12:20:47,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:20:47,298 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:20:47,298 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:20:47,298 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:20:47,299 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:19:56" (3/4) ... [2018-11-10 12:20:47,305 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 12:20:47,316 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,316 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,316 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,316 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,316 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,317 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,317 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,317 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,317 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,317 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,317 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,317 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,317 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,317 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,318 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,318 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,318 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,318 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,318 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,318 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,318 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,318 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,318 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,318 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-10 12:20:47,376 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_605eafe9-9377-4345-9b98-647ea9d4be27/bin-2019/uautomizer/witness.graphml [2018-11-10 12:20:47,376 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:20:47,377 INFO L168 Benchmark]: Toolchain (without parser) took 51510.40 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 432.5 MB). Free memory was 959.1 MB in the beginning and 1.3 GB in the end (delta: -345.7 MB). Peak memory consumption was 86.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:20:47,379 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:20:47,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.13 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:20:47,380 INFO L168 Benchmark]: Boogie Preprocessor took 28.23 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:20:47,380 INFO L168 Benchmark]: RCFGBuilder took 376.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:20:47,380 INFO L168 Benchmark]: TraceAbstraction took 50839.67 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -213.0 MB). Peak memory consumption was 592.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:20:47,380 INFO L168 Benchmark]: Witness Printer took 78.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:20:47,382 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 185.13 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.23 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 376.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 50839.67 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -213.0 MB). Peak memory consumption was 592.8 MB. Max. memory is 11.5 GB. * Witness Printer took 78.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 38]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L48] FCALL "%d\n" VAL ["%d\n"={112:0}, \old("%d\n")=110, \old("%d\n")=107, \old(array)=null, \old(array)=null, \old(numbers2)=null, \old(numbers2)=null, \old(numbers4)=null, \old(numbers4)=null, array={114:115}, numbers2={103:111}, numbers4={102:113}] [L6] FCALL static int array[10]; VAL ["%d\n"={112:0}, \old("%d\n")=107, \old("%d\n")=110, \old(array)=null, \old(array)=null, \old(numbers2)=null, \old(numbers2)=null, \old(numbers4)=null, \old(numbers4)=null, array={106:0}, numbers2={103:111}, numbers4={102:113}] [L17] FCALL static int numbers2[10]; VAL ["%d\n"={112:0}, \old("%d\n")=110, \old("%d\n")=107, \old(array)=null, \old(array)=null, \old(numbers2)=null, \old(numbers2)=null, \old(numbers4)=null, \old(numbers4)=null, array={106:0}, numbers2={109:0}, numbers4={102:113}] [L36] FCALL static int numbers4[10]; VAL ["%d\n"={112:0}, \old("%d\n")=110, \old("%d\n")=107, \old(array)=null, \old(array)=null, \old(numbers2)=null, \old(numbers2)=null, \old(numbers4)=null, \old(numbers4)=null, array={106:0}, numbers2={109:0}, numbers4={108:0}] [L45] CALL getNumbers4() VAL ["%d\n"={112:0}, array={106:0}, numbers2={109:0}, numbers4={108:0}] [L35] CALL, EXPR getNumbers3() VAL ["%d\n"={112:0}, array={106:0}, numbers2={109:0}, numbers4={108:0}] [L25] CALL, EXPR getNumbers2() VAL ["%d\n"={112:0}, array={106:0}, numbers2={109:0}, numbers4={108:0}] [L16] CALL, EXPR getNumbers() VAL ["%d\n"={112:0}, array={106:0}, numbers2={109:0}, numbers4={108:0}] [L8] int i = 0; VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=10, numbers2={109:0}, numbers4={108:0}] [L8] COND FALSE !(i < 10) VAL ["%d\n"={112:0}, array={106:0}, i=10, numbers2={109:0}, numbers4={108:0}] [L12] RET return array; VAL ["%d\n"={112:0}, \result={106:0}, array={106:0}, i=10, numbers2={109:0}, numbers4={108:0}] [L16] EXPR getNumbers() VAL ["%d\n"={112:0}, array={106:0}, getNumbers()={106:0}, numbers2={109:0}, numbers4={108:0}] [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=0] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=0] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=1] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=1] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=2] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=2] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=3] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=3] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=4] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=4] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=5] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=5] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=6] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=6] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=7] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=7] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=8] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=8] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=9] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=9] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=10, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND FALSE !(i < 10) VAL ["%d\n"={112:0}, array={106:0}, i=10, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L21] RET return numbers2; VAL ["%d\n"={112:0}, \result={109:0}, array={106:0}, i=10, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L25] EXPR getNumbers2() VAL ["%d\n"={112:0}, array={106:0}, getNumbers2()={109:0}, numbers2={109:0}, numbers4={108:0}] [L25] int* numbers = getNumbers2(); [L26] FCALL int numbers3[10]; VAL ["%d\n"={112:0}, array={106:0}, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] int i = 0; VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=0] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=0] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=1] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=1] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=2] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=2] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=3] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=3] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=4] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=4] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=5] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=5] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=6] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=6] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=7] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=7] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=8] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=8] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=9] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=9] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=10, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND FALSE !(i < 10) VAL ["%d\n"={112:0}, array={106:0}, i=10, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L31] return numbers3; VAL ["%d\n"={112:0}, \result={104:0}, array={106:0}, i=10, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L31] RET return numbers3; VAL ["%d\n"={112:0}, \result={104:0}, array={106:0}, i=10, numbers={109:0}, numbers2={109:0}, numbers4={108:0}] [L35] EXPR getNumbers3() VAL ["%d\n"={112:0}, array={106:0}, getNumbers3()={104:0}, numbers2={109:0}, numbers4={108:0}] [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={104:0}, numbers2={109:0}, numbers4={108:0}] [L37] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={104:0}, numbers2={109:0}, numbers4={108:0}] [L38] FCALL numbers[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 114 locations, 17 error locations. UNSAFE Result, 50.8s OverallTime, 29 OverallIterations, 11 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2582 SDtfs, 1765 SDslu, 13773 SDs, 0 SdLazy, 3495 SolverSat, 251 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3368 GetRequests, 3073 SyntacticMatches, 6 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 83 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 42.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 6739 NumberOfCodeBlocks, 6391 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 6458 ConstructedInterpolants, 252 QuantifiedInterpolants, 2133416 SizeOfPredicates, 50 NumberOfNonLiveVariables, 7641 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 51 InterpolantComputations, 11 PerfectInterpolantSequences, 9715/13159 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...