./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers2_false-valid-deref.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers2_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/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 e872a0dffbf376eb2d8b1e3516401a8dafe115a6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-635dfa2 [2018-12-02 21:03:19,490 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:03:19,491 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:03:19,497 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:03:19,497 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:03:19,497 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:03:19,498 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:03:19,499 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:03:19,500 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:03:19,500 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:03:19,501 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:03:19,501 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:03:19,501 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:03:19,502 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:03:19,502 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:03:19,503 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:03:19,503 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:03:19,504 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:03:19,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:03:19,506 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:03:19,506 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:03:19,507 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:03:19,508 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:03:19,508 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:03:19,508 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:03:19,509 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:03:19,509 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:03:19,510 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:03:19,510 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:03:19,511 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:03:19,511 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:03:19,511 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:03:19,511 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:03:19,511 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:03:19,512 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:03:19,512 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:03:19,512 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 21:03:19,520 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:03:19,520 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:03:19,520 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:03:19,520 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:03:19,521 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 21:03:19,521 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 21:03:19,521 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 21:03:19,521 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:03:19,521 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:03:19,521 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 21:03:19,521 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:03:19,521 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:03:19,521 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:03:19,521 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 21:03:19,521 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 21:03:19,522 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 21:03:19,522 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:03:19,522 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:03:19,522 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 21:03:19,522 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:03:19,522 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:03:19,522 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:03:19,522 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:03:19,522 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:03:19,522 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:03:19,522 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:03:19,522 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 21:03:19,523 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:03:19,523 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_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/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 -> e872a0dffbf376eb2d8b1e3516401a8dafe115a6 [2018-12-02 21:03:19,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:03:19,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:03:19,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:03:19,549 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:03:19,550 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:03:19,550 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext3/getNumbers2_false-valid-deref.c [2018-12-02 21:03:19,584 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/bin-2019/uautomizer/data/c57853fe9/cef0e76192074f30bc1e7959e6724e1b/FLAG468aec926 [2018-12-02 21:03:19,976 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:03:19,976 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/sv-benchmarks/c/memsafety-ext3/getNumbers2_false-valid-deref.c [2018-12-02 21:03:19,979 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/bin-2019/uautomizer/data/c57853fe9/cef0e76192074f30bc1e7959e6724e1b/FLAG468aec926 [2018-12-02 21:03:19,987 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/bin-2019/uautomizer/data/c57853fe9/cef0e76192074f30bc1e7959e6724e1b [2018-12-02 21:03:19,989 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:03:19,989 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 21:03:19,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:03:19,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:03:19,992 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:03:19,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:03:19" (1/1) ... [2018-12-02 21:03:19,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c56171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:03:19, skipping insertion in model container [2018-12-02 21:03:19,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:03:19" (1/1) ... [2018-12-02 21:03:19,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:03:20,006 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:03:20,091 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:03:20,098 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:03:20,108 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:03:20,119 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:03:20,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:03:20 WrapperNode [2018-12-02 21:03:20,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:03:20,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:03:20,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:03:20,120 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:03:20,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:03:20" (1/1) ... [2018-12-02 21:03:20,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:03:20" (1/1) ... [2018-12-02 21:03:20,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:03:20" (1/1) ... [2018-12-02 21:03:20,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:03:20" (1/1) ... [2018-12-02 21:03:20,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:03:20" (1/1) ... [2018-12-02 21:03:20,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:03:20" (1/1) ... [2018-12-02 21:03:20,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:03:20" (1/1) ... [2018-12-02 21:03:20,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:03:20,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:03:20,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:03:20,172 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:03:20,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:03:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:03:20,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:03:20,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:03:20,209 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-12-02 21:03:20,209 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-12-02 21:03:20,209 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:03:20,209 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-12-02 21:03:20,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 21:03:20,210 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-12-02 21:03:20,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 21:03:20,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 21:03:20,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 21:03:20,210 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:03:20,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:03:20,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:03:20,346 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:03:20,346 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 21:03:20,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:03:20 BoogieIcfgContainer [2018-12-02 21:03:20,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:03:20,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:03:20,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:03:20,350 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:03:20,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:03:19" (1/3) ... [2018-12-02 21:03:20,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ae683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:03:20, skipping insertion in model container [2018-12-02 21:03:20,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:03:20" (2/3) ... [2018-12-02 21:03:20,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ae683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:03:20, skipping insertion in model container [2018-12-02 21:03:20,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:03:20" (3/3) ... [2018-12-02 21:03:20,353 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers2_false-valid-deref.c [2018-12-02 21:03:20,362 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:03:20,370 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-02 21:03:20,385 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-02 21:03:20,407 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 21:03:20,407 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:03:20,408 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 21:03:20,408 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:03:20,408 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:03:20,408 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:03:20,408 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:03:20,408 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:03:20,408 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:03:20,421 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-12-02 21:03:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 21:03:20,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:20,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:20,431 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:20,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:20,436 INFO L82 PathProgramCache]: Analyzing trace with hash -262167437, now seen corresponding path program 1 times [2018-12-02 21:03:20,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:20,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:20,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:20,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:20,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:03:20,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:03:20,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:03:20,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:03:20,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:03:20,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:03:20,595 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 4 states. [2018-12-02 21:03:20,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:20,657 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-02 21:03:20,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:03:20,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 21:03:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:20,664 INFO L225 Difference]: With dead ends: 43 [2018-12-02 21:03:20,664 INFO L226 Difference]: Without dead ends: 40 [2018-12-02 21:03:20,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:03:20,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-02 21:03:20,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-12-02 21:03:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 21:03:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-12-02 21:03:20,686 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 10 [2018-12-02 21:03:20,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:20,686 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-12-02 21:03:20,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:03:20,686 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-12-02 21:03:20,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 21:03:20,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:20,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:20,687 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:20,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:20,687 INFO L82 PathProgramCache]: Analyzing trace with hash -262167438, now seen corresponding path program 1 times [2018-12-02 21:03:20,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:20,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:20,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:20,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:20,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:03:20,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:03:20,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:03:20,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:03:20,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:03:20,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:03:20,713 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 3 states. [2018-12-02 21:03:20,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:20,726 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-12-02 21:03:20,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:03:20,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 21:03:20,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:20,727 INFO L225 Difference]: With dead ends: 37 [2018-12-02 21:03:20,727 INFO L226 Difference]: Without dead ends: 37 [2018-12-02 21:03:20,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:03:20,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-02 21:03:20,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-02 21:03:20,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 21:03:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-02 21:03:20,730 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 10 [2018-12-02 21:03:20,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:20,730 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-02 21:03:20,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:03:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-02 21:03:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 21:03:20,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:20,731 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:20,731 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:20,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:20,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1979581628, now seen corresponding path program 1 times [2018-12-02 21:03:20,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:20,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:20,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:20,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:20,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:20,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:03:20,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:20,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:03:20,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:20,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:20,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 21:03:20,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:20,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:03:20,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:03:20,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:03:20,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:03:20,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-02 21:03:20,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:03:20,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:03:20,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:03:20,886 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 5 states. [2018-12-02 21:03:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:20,941 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-12-02 21:03:20,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:03:20,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-02 21:03:20,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:20,942 INFO L225 Difference]: With dead ends: 41 [2018-12-02 21:03:20,942 INFO L226 Difference]: Without dead ends: 41 [2018-12-02 21:03:20,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:03:20,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-02 21:03:20,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-02 21:03:20,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 21:03:20,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-12-02 21:03:20,945 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 13 [2018-12-02 21:03:20,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:20,945 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-12-02 21:03:20,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:03:20,946 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-12-02 21:03:20,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 21:03:20,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:20,946 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:20,946 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:20,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:20,946 INFO L82 PathProgramCache]: Analyzing trace with hash 479651539, now seen corresponding path program 2 times [2018-12-02 21:03:20,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:20,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:20,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:20,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:20,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 21:03:21,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:03:21,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:03:21,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:03:21,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:03:21,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:03:21,028 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 6 states. [2018-12-02 21:03:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:21,057 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-02 21:03:21,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:03:21,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-02 21:03:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:21,058 INFO L225 Difference]: With dead ends: 39 [2018-12-02 21:03:21,058 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 21:03:21,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:03:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 21:03:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-12-02 21:03:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 21:03:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-12-02 21:03:21,062 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 16 [2018-12-02 21:03:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:21,063 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-12-02 21:03:21,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:03:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-12-02 21:03:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 21:03:21,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:21,063 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:21,063 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:21,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:21,064 INFO L82 PathProgramCache]: Analyzing trace with hash -680983352, now seen corresponding path program 1 times [2018-12-02 21:03:21,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:21,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:21,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:21,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:03:21,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:21,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:03:21,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:21,094 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:03:21,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:21,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:03:21,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:03:21,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-02 21:03:21,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:03:21,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:03:21,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:03:21,138 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 6 states. [2018-12-02 21:03:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:21,150 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-02 21:03:21,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:03:21,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-02 21:03:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:21,151 INFO L225 Difference]: With dead ends: 43 [2018-12-02 21:03:21,151 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 21:03:21,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 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-12-02 21:03:21,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 21:03:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-12-02 21:03:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 21:03:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-02 21:03:21,154 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 21 [2018-12-02 21:03:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:21,154 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-02 21:03:21,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:03:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-02 21:03:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 21:03:21,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:21,155 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:21,155 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:21,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:21,155 INFO L82 PathProgramCache]: Analyzing trace with hash 974975319, now seen corresponding path program 2 times [2018-12-02 21:03:21,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:21,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:21,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:21,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:21,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:21,184 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:03:21,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:21,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:03:21,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 21:03:21,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-02 21:03:21,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:03:21,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:21,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 21:03:21,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:21,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 21:03:21,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 21:03:21,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:03:21,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:03:21,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:9, output treesize:21 [2018-12-02 21:03:21,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:21,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:21,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-12-02 21:03:21,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:21,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:21,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:21,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:21,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2018-12-02 21:03:21,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 21:03:21,324 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 3 xjuncts. [2018-12-02 21:03:21,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:54 [2018-12-02 21:03:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 21:03:21,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 21:03:21,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2018-12-02 21:03:21,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 21:03:21,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 21:03:21,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:03:21,375 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 10 states. [2018-12-02 21:03:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:21,557 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-12-02 21:03:21,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:03:21,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-02 21:03:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:21,558 INFO L225 Difference]: With dead ends: 45 [2018-12-02 21:03:21,558 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 21:03:21,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-12-02 21:03:21,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 21:03:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-12-02 21:03:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 21:03:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-02 21:03:21,561 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 24 [2018-12-02 21:03:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:21,561 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-02 21:03:21,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 21:03:21,561 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-02 21:03:21,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 21:03:21,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:21,562 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:21,562 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:21,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:21,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1645381225, now seen corresponding path program 1 times [2018-12-02 21:03:21,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:21,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:21,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:21,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:03:21,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:21,598 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:03:21,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:21,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:03:21,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:21,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:03:21,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:03:21,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-02 21:03:21,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:03:21,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:03:21,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:03:21,638 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 8 states. [2018-12-02 21:03:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:21,656 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-12-02 21:03:21,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:03:21,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-02 21:03:21,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:21,658 INFO L225 Difference]: With dead ends: 48 [2018-12-02 21:03:21,658 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 21:03:21,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 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-12-02 21:03:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 21:03:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-12-02 21:03:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 21:03:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-12-02 21:03:21,661 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 27 [2018-12-02 21:03:21,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:21,661 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-12-02 21:03:21,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:03:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-12-02 21:03:21,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 21:03:21,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:21,662 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:21,662 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:21,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:21,663 INFO L82 PathProgramCache]: Analyzing trace with hash 2109770680, now seen corresponding path program 2 times [2018-12-02 21:03:21,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:21,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:21,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:21,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:21,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:03:21,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:21,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:03:21,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 21:03:21,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-02 21:03:21,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:03:21,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:21,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 21:03:21,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:21,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 21:03:21,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:21,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 21:03:21,742 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 21:03:21,748 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:03:21,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:03:21,757 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:37 [2018-12-02 21:03:21,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:21,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-12-02 21:03:21,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:21,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:21,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2018-12-02 21:03:21,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:21,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:21,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:21,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-12-02 21:03:21,867 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:21,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:21,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:21,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:21,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-02 21:03:21,887 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:21,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 21:03:21,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:65, output treesize:50 [2018-12-02 21:03:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-02 21:03:21,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 21:03:21,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2018-12-02 21:03:21,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 21:03:21,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 21:03:21,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:03:21,970 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 13 states. [2018-12-02 21:03:22,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:22,270 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-12-02 21:03:22,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 21:03:22,271 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-12-02 21:03:22,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:22,271 INFO L225 Difference]: With dead ends: 51 [2018-12-02 21:03:22,271 INFO L226 Difference]: Without dead ends: 51 [2018-12-02 21:03:22,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-12-02 21:03:22,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-02 21:03:22,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-12-02 21:03:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 21:03:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-02 21:03:22,274 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 30 [2018-12-02 21:03:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:22,274 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-02 21:03:22,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 21:03:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-02 21:03:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 21:03:22,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:22,275 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:22,275 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:22,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:22,275 INFO L82 PathProgramCache]: Analyzing trace with hash 432910569, now seen corresponding path program 1 times [2018-12-02 21:03:22,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:22,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:22,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:22,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:03:22,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-02 21:03:22,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:03:22,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:03:22,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:03:22,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:03:22,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:03:22,293 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 3 states. [2018-12-02 21:03:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:22,302 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-12-02 21:03:22,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:03:22,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-02 21:03:22,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:22,303 INFO L225 Difference]: With dead ends: 48 [2018-12-02 21:03:22,303 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 21:03:22,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:03:22,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 21:03:22,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-02 21:03:22,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 21:03:22,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-02 21:03:22,306 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 34 [2018-12-02 21:03:22,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:22,306 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-02 21:03:22,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:03:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-02 21:03:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 21:03:22,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:22,307 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:22,307 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:22,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:22,308 INFO L82 PathProgramCache]: Analyzing trace with hash 432910570, now seen corresponding path program 1 times [2018-12-02 21:03:22,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:22,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:22,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:22,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:22,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:03:22,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:22,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/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-12-02 21:03:22,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:22,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:22,407 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:03:22,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:03:22,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-02 21:03:22,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 21:03:22,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 21:03:22,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:03:22,422 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 10 states. [2018-12-02 21:03:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:22,442 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-12-02 21:03:22,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:03:22,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-12-02 21:03:22,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:22,442 INFO L225 Difference]: With dead ends: 53 [2018-12-02 21:03:22,443 INFO L226 Difference]: Without dead ends: 53 [2018-12-02 21:03:22,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 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-12-02 21:03:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-02 21:03:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-12-02 21:03:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-02 21:03:22,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-02 21:03:22,444 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 34 [2018-12-02 21:03:22,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:22,445 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-02 21:03:22,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 21:03:22,445 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-02 21:03:22,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 21:03:22,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:22,445 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:22,445 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:22,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:22,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1833114437, now seen corresponding path program 2 times [2018-12-02 21:03:22,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:22,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:22,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:03:22,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:22,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/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-12-02 21:03:22,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 21:03:22,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-02 21:03:22,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:03:22,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:22,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 21:03:22,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:22,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:03:22,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-02 21:03:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-02 21:03:22,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 21:03:22,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2018-12-02 21:03:22,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:03:22,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:03:22,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:03:22,549 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 12 states. [2018-12-02 21:03:22,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:22,590 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-12-02 21:03:22,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:03:22,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-12-02 21:03:22,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:22,591 INFO L225 Difference]: With dead ends: 55 [2018-12-02 21:03:22,591 INFO L226 Difference]: Without dead ends: 55 [2018-12-02 21:03:22,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:03:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-02 21:03:22,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-12-02 21:03:22,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-02 21:03:22,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-02 21:03:22,594 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 37 [2018-12-02 21:03:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:22,594 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-02 21:03:22,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:03:22,594 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-02 21:03:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 21:03:22,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:22,595 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 21:03:22,595 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:22,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:22,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1195635521, now seen corresponding path program 1 times [2018-12-02 21:03:22,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:22,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:22,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:22,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:03:22,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:03:22,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:22,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/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-12-02 21:03:22,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:22,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:03:22,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:03:22,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-12-02 21:03:22,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:03:22,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:03:22,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:03:22,740 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 12 states. [2018-12-02 21:03:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:22,767 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-12-02 21:03:22,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:03:22,768 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-12-02 21:03:22,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:22,768 INFO L225 Difference]: With dead ends: 58 [2018-12-02 21:03:22,769 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 21:03:22,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 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-12-02 21:03:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 21:03:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-12-02 21:03:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 21:03:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-12-02 21:03:22,772 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 48 [2018-12-02 21:03:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:22,772 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-12-02 21:03:22,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:03:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-12-02 21:03:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 21:03:22,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:22,773 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 21:03:22,773 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:22,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:22,773 INFO L82 PathProgramCache]: Analyzing trace with hash 71279954, now seen corresponding path program 2 times [2018-12-02 21:03:22,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:22,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:22,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:22,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:22,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:03:22,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:22,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/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-12-02 21:03:22,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 21:03:22,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 21:03:22,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:03:22,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:03:22,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:03:22,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-02 21:03:22,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 21:03:22,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 21:03:22,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:03:22,911 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 13 states. [2018-12-02 21:03:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:22,939 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-12-02 21:03:22,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:03:22,939 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-12-02 21:03:22,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:22,940 INFO L225 Difference]: With dead ends: 59 [2018-12-02 21:03:22,940 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 21:03:22,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 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-12-02 21:03:22,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 21:03:22,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-02 21:03:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 21:03:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-02 21:03:22,942 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 51 [2018-12-02 21:03:22,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:22,943 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-02 21:03:22,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 21:03:22,943 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-02 21:03:22,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 21:03:22,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:22,943 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 21:03:22,944 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:22,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:22,944 INFO L82 PathProgramCache]: Analyzing trace with hash 844524961, now seen corresponding path program 3 times [2018-12-02 21:03:22,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:22,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:22,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:22,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:03:22,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 21:03:22,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:22,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/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-12-02 21:03:22,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:03:22,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 21:03:22,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:03:22,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 21:03:23,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:03:23,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-02 21:03:23,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:03:23,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:03:23,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:03:23,020 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 5 states. [2018-12-02 21:03:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:23,033 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2018-12-02 21:03:23,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:03:23,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-02 21:03:23,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:23,034 INFO L225 Difference]: With dead ends: 68 [2018-12-02 21:03:23,034 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 21:03:23,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-12-02 21:03:23,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 21:03:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2018-12-02 21:03:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-02 21:03:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-12-02 21:03:23,037 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 54 [2018-12-02 21:03:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:23,038 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-12-02 21:03:23,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:03:23,038 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-12-02 21:03:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 21:03:23,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:23,039 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:23,039 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:23,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:23,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1486456989, now seen corresponding path program 4 times [2018-12-02 21:03:23,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:23,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:23,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:23,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:03:23,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 21:03:23,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:23,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/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-12-02 21:03:23,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:03:23,129 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:03:23,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:03:23,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 21:03:23,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:03:23,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-02 21:03:23,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:03:23,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:03:23,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:03:23,153 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 6 states. [2018-12-02 21:03:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:23,175 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-12-02 21:03:23,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:03:23,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-02 21:03:23,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:23,176 INFO L225 Difference]: With dead ends: 73 [2018-12-02 21:03:23,176 INFO L226 Difference]: Without dead ends: 73 [2018-12-02 21:03:23,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 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-12-02 21:03:23,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-02 21:03:23,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-12-02 21:03:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-02 21:03:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-02 21:03:23,178 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 59 [2018-12-02 21:03:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:23,178 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-02 21:03:23,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:03:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-02 21:03:23,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 21:03:23,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:23,179 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:23,179 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:23,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:23,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1338250463, now seen corresponding path program 5 times [2018-12-02 21:03:23,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:23,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:23,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:23,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:03:23,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 21:03:23,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:23,202 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/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-12-02 21:03:23,208 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 21:03:23,262 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-12-02 21:03:23,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:03:23,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 21:03:23,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:03:23,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-02 21:03:23,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:03:23,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:03:23,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:03:23,288 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 7 states. [2018-12-02 21:03:23,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:23,307 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-12-02 21:03:23,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:03:23,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-12-02 21:03:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:23,308 INFO L225 Difference]: With dead ends: 78 [2018-12-02 21:03:23,308 INFO L226 Difference]: Without dead ends: 78 [2018-12-02 21:03:23,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 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-12-02 21:03:23,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-02 21:03:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-12-02 21:03:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-02 21:03:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-12-02 21:03:23,310 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 64 [2018-12-02 21:03:23,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:23,310 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-12-02 21:03:23,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:03:23,310 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-12-02 21:03:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 21:03:23,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:23,311 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:23,311 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:23,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:23,312 INFO L82 PathProgramCache]: Analyzing trace with hash -368674019, now seen corresponding path program 6 times [2018-12-02 21:03:23,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:23,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:23,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:23,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:03:23,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 21:03:23,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:23,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/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-12-02 21:03:23,367 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 21:03:23,452 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-12-02 21:03:23,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:03:23,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 28 proven. 34 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-02 21:03:23,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:03:23,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 17 [2018-12-02 21:03:23,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 21:03:23,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 21:03:23,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-02 21:03:23,564 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 17 states. [2018-12-02 21:03:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:23,663 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-12-02 21:03:23,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:03:23,663 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2018-12-02 21:03:23,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:23,664 INFO L225 Difference]: With dead ends: 83 [2018-12-02 21:03:23,664 INFO L226 Difference]: Without dead ends: 83 [2018-12-02 21:03:23,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-12-02 21:03:23,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-02 21:03:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-12-02 21:03:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 21:03:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-02 21:03:23,666 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 69 [2018-12-02 21:03:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:23,666 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-02 21:03:23,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 21:03:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-02 21:03:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 21:03:23,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:23,667 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:23,667 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:23,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:23,667 INFO L82 PathProgramCache]: Analyzing trace with hash -243103583, now seen corresponding path program 7 times [2018-12-02 21:03:23,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:23,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:23,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:23,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:03:23,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 21:03:23,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:23,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/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-12-02 21:03:23,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:23,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 21:03:23,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:03:23,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-02 21:03:23,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 21:03:23,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:03:23,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:03:23,749 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 9 states. [2018-12-02 21:03:23,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:23,772 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2018-12-02 21:03:23,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:03:23,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-12-02 21:03:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:23,773 INFO L225 Difference]: With dead ends: 88 [2018-12-02 21:03:23,773 INFO L226 Difference]: Without dead ends: 88 [2018-12-02 21:03:23,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 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-12-02 21:03:23,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-02 21:03:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-12-02 21:03:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-02 21:03:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-12-02 21:03:23,774 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 74 [2018-12-02 21:03:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:23,774 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-12-02 21:03:23,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 21:03:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-12-02 21:03:23,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 21:03:23,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:23,775 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:23,775 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:23,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:23,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1204178333, now seen corresponding path program 8 times [2018-12-02 21:03:23,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:23,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:23,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:23,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:23,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 21:03:23,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:23,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/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-12-02 21:03:23,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 21:03:23,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 21:03:23,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:03:23,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 21:03:23,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:03:23,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-02 21:03:23,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 21:03:23,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 21:03:23,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:03:23,889 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 10 states. [2018-12-02 21:03:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:23,913 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-12-02 21:03:23,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:03:23,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2018-12-02 21:03:23,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:23,914 INFO L225 Difference]: With dead ends: 93 [2018-12-02 21:03:23,914 INFO L226 Difference]: Without dead ends: 93 [2018-12-02 21:03:23,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 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-12-02 21:03:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-02 21:03:23,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2018-12-02 21:03:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 21:03:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-12-02 21:03:23,916 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 79 [2018-12-02 21:03:23,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:23,917 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-12-02 21:03:23,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 21:03:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-12-02 21:03:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 21:03:23,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:23,917 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:23,918 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:23,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:23,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2025699807, now seen corresponding path program 9 times [2018-12-02 21:03:23,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:23,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:23,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:23,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:03:23,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 21:03:23,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:23,967 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/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-12-02 21:03:23,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:03:24,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-02 21:03:24,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:03:24,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 21:03:24,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:03:24,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-12-02 21:03:24,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 21:03:24,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 21:03:24,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-02 21:03:24,203 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 11 states. [2018-12-02 21:03:24,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:24,231 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2018-12-02 21:03:24,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:03:24,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2018-12-02 21:03:24,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:24,232 INFO L225 Difference]: With dead ends: 98 [2018-12-02 21:03:24,232 INFO L226 Difference]: Without dead ends: 98 [2018-12-02 21:03:24,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 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-12-02 21:03:24,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-02 21:03:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2018-12-02 21:03:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-02 21:03:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-12-02 21:03:24,234 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 84 [2018-12-02 21:03:24,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:24,234 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-12-02 21:03:24,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 21:03:24,234 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-12-02 21:03:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 21:03:24,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:24,234 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:03:24,234 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:24,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:24,234 INFO L82 PathProgramCache]: Analyzing trace with hash -809435107, now seen corresponding path program 10 times [2018-12-02 21:03:24,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:24,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:24,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:24,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:03:24,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 21:03:24,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:24,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/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-12-02 21:03:24,327 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:03:24,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:03:24,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:03:24,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 21:03:24,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:03:24,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-12-02 21:03:24,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:03:24,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:03:24,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:03:24,528 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 12 states. [2018-12-02 21:03:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:24,555 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-12-02 21:03:24,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:03:24,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2018-12-02 21:03:24,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:24,556 INFO L225 Difference]: With dead ends: 103 [2018-12-02 21:03:24,556 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 21:03:24,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 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-12-02 21:03:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 21:03:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-12-02 21:03:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 21:03:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-02 21:03:24,558 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 89 [2018-12-02 21:03:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:24,558 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-02 21:03:24,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:03:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-02 21:03:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 21:03:24,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:24,558 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 21:03:24,558 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:24,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:24,559 INFO L82 PathProgramCache]: Analyzing trace with hash -2070731871, now seen corresponding path program 11 times [2018-12-02 21:03:24,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:24,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:24,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:24,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:03:24,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 21:03:24,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:03:24,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/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-12-02 21:03:24,621 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 21:03:26,244 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-12-02 21:03:26,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:03:26,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:03:26,259 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 21:03:26,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:03:26,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-02 21:03:26,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 21:03:26,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 21:03:26,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:03:26,276 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 13 states. [2018-12-02 21:03:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:26,308 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2018-12-02 21:03:26,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:03:26,308 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2018-12-02 21:03:26,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:26,308 INFO L225 Difference]: With dead ends: 104 [2018-12-02 21:03:26,309 INFO L226 Difference]: Without dead ends: 104 [2018-12-02 21:03:26,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 94 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-12-02 21:03:26,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-02 21:03:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-02 21:03:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 21:03:26,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-12-02 21:03:26,311 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 94 [2018-12-02 21:03:26,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:26,311 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-12-02 21:03:26,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 21:03:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-12-02 21:03:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 21:03:26,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:26,312 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 21:03:26,312 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-02 21:03:26,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:26,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1646357859, now seen corresponding path program 12 times [2018-12-02 21:03:26,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:03:26,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:03:26,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:26,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:03:26,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:03:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:03:26,412 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 21:03:26,428 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# [2018-12-02 21:03:26,428 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# [2018-12-02 21:03:26,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:03:26 BoogieIcfgContainer [2018-12-02 21:03:26,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 21:03:26,440 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:03:26,440 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:03:26,441 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:03:26,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:03:20" (3/4) ... [2018-12-02 21:03:26,442 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 21:03:26,446 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# [2018-12-02 21:03:26,447 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# [2018-12-02 21:03:26,479 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_740f1a12-cac9-4f10-bd0d-e9f859ac1c38/bin-2019/uautomizer/witness.graphml [2018-12-02 21:03:26,480 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:03:26,480 INFO L168 Benchmark]: Toolchain (without parser) took 6491.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 289.9 MB). Free memory was 961.3 MB in the beginning and 916.3 MB in the end (delta: 45.1 MB). Peak memory consumption was 335.0 MB. Max. memory is 11.5 GB. [2018-12-02 21:03:26,481 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:03:26,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 129.12 ms. Allocated memory is still 1.0 GB. Free memory was 961.3 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:03:26,481 INFO L168 Benchmark]: Boogie Preprocessor took 51.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-02 21:03:26,482 INFO L168 Benchmark]: RCFGBuilder took 175.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2018-12-02 21:03:26,482 INFO L168 Benchmark]: TraceAbstraction took 6093.33 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 916.3 MB in the end (delta: 171.0 MB). Peak memory consumption was 346.1 MB. Max. memory is 11.5 GB. [2018-12-02 21:03:26,482 INFO L168 Benchmark]: Witness Printer took 39.18 ms. Allocated memory is still 1.3 GB. Free memory is still 916.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:03:26,483 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 129.12 ms. Allocated memory is still 1.0 GB. Free memory was 961.3 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 175.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6093.33 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 916.3 MB in the end (delta: 171.0 MB). Peak memory consumption was 346.1 MB. Max. memory is 11.5 GB. * Witness Printer took 39.18 ms. Allocated memory is still 1.3 GB. Free memory is still 916.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 26]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1] int array[10]; VAL [\old(array)=null, \old(array)=null, array={42:0}] [L25] CALL, EXPR getNumbers2() VAL [array={42:0}] [L13] CALL, EXPR getNumbers() VAL [array={42:0}] [L5] int i = 0; VAL [array={42:0}, i=0] [L5] COND TRUE i < 10 VAL [array={42:0}, i=0] [L6] array[i] = i VAL [array={42:0}, i=0] [L5] ++i VAL [array={42:0}, i=1] [L5] COND TRUE i < 10 VAL [array={42:0}, i=1] [L6] array[i] = i VAL [array={42:0}, i=1] [L5] ++i VAL [array={42:0}, i=2] [L5] COND TRUE i < 10 VAL [array={42:0}, i=2] [L6] array[i] = i VAL [array={42:0}, i=2] [L5] ++i VAL [array={42:0}, i=3] [L5] COND TRUE i < 10 VAL [array={42:0}, i=3] [L6] array[i] = i VAL [array={42:0}, i=3] [L5] ++i VAL [array={42:0}, i=4] [L5] COND TRUE i < 10 VAL [array={42:0}, i=4] [L6] array[i] = i VAL [array={42:0}, i=4] [L5] ++i VAL [array={42:0}, i=5] [L5] COND TRUE i < 10 VAL [array={42:0}, i=5] [L6] array[i] = i VAL [array={42:0}, i=5] [L5] ++i VAL [array={42:0}, i=6] [L5] COND TRUE i < 10 VAL [array={42:0}, i=6] [L6] array[i] = i VAL [array={42:0}, i=6] [L5] ++i VAL [array={42:0}, i=7] [L5] COND TRUE i < 10 VAL [array={42:0}, i=7] [L6] array[i] = i VAL [array={42:0}, i=7] [L5] ++i VAL [array={42:0}, i=8] [L5] COND TRUE i < 10 VAL [array={42:0}, i=8] [L6] array[i] = i VAL [array={42:0}, i=8] [L5] ++i VAL [array={42:0}, i=9] [L5] COND TRUE i < 10 VAL [array={42:0}, i=9] [L6] array[i] = i VAL [array={42:0}, i=9] [L5] ++i VAL [array={42:0}, i=10] [L5] COND FALSE !(i < 10) VAL [array={42:0}, i=10] [L9] return array; VAL [\result={42:0}, array={42:0}, i=10] [L13] RET, EXPR getNumbers() VAL [array={42:0}, getNumbers()={42:0}] [L13] int* numbers = getNumbers(); [L15] int numbers2[10]; [L17] int i = 0; VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}, numbers[i]=0] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}, numbers[i]=0] [L17] ++i VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}, numbers[i]=1] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}, numbers[i]=1] [L17] ++i VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}, numbers[i]=2] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}, numbers[i]=2] [L17] ++i VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}, numbers[i]=3] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}, numbers[i]=3] [L17] ++i VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}, numbers[i]=4] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}, numbers[i]=4] [L17] ++i VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}, numbers[i]=5] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}, numbers[i]=5] [L17] ++i VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}, numbers[i]=6] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}, numbers[i]=6] [L17] ++i VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}, numbers[i]=7] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}, numbers[i]=7] [L17] ++i VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}, numbers[i]=8] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}, numbers[i]=8] [L17] ++i VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}, numbers[i]=9] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}, numbers[i]=9] [L17] ++i VAL [array={42:0}, i=10, numbers={42:0}, numbers2={46:0}] [L17] COND FALSE !(i < 10) VAL [array={42:0}, i=10, numbers={42:0}, numbers2={46:0}] [L21] return numbers2; [L21] return numbers2; VAL [\result={46:0}, array={42:0}, i=10, numbers={42:0}] [L25] RET, EXPR getNumbers2() VAL [array={42:0}, getNumbers2()={46:0}] [L25] int *numbers = getNumbers2(); [L26] numbers[0] = 100 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 9 error locations. UNSAFE Result, 6.0s OverallTime, 23 OverallIterations, 10 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 580 SDtfs, 537 SDslu, 1877 SDs, 0 SdLazy, 1056 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1116 GetRequests, 939 SyntacticMatches, 9 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 50 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2071 NumberOfCodeBlocks, 1984 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 1932 ConstructedInterpolants, 4 QuantifiedInterpolants, 273191 SizeOfPredicates, 30 NumberOfNonLiveVariables, 3190 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 40 InterpolantComputations, 7 PerfectInterpolantSequences, 2789/4774 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...