./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.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_59c847a1-2a8e-492d-9995-49e3c73da096/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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 b8a667539b0a7850f9a7aa38ebbe1ead0e2c55d4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 15:53:48,540 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 15:53:48,541 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 15:53:48,546 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 15:53:48,547 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 15:53:48,547 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 15:53:48,548 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 15:53:48,548 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 15:53:48,549 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 15:53:48,550 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 15:53:48,550 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 15:53:48,550 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 15:53:48,551 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 15:53:48,551 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 15:53:48,552 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 15:53:48,552 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 15:53:48,552 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 15:53:48,553 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 15:53:48,554 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 15:53:48,555 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 15:53:48,555 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 15:53:48,556 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 15:53:48,557 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 15:53:48,557 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 15:53:48,557 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 15:53:48,558 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 15:53:48,558 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 15:53:48,559 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 15:53:48,559 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 15:53:48,559 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 15:53:48,560 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 15:53:48,560 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 15:53:48,560 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 15:53:48,560 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 15:53:48,561 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 15:53:48,561 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 15:53:48,561 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-01 15:53:48,568 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 15:53:48,568 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 15:53:48,568 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 15:53:48,569 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 15:53:48,569 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 15:53:48,569 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 15:53:48,569 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 15:53:48,569 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 15:53:48,569 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 15:53:48,569 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 15:53:48,569 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 15:53:48,570 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 15:53:48,570 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 15:53:48,570 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 15:53:48,570 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 15:53:48,570 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-01 15:53:48,570 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 15:53:48,570 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 15:53:48,570 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 15:53:48,570 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 15:53:48,570 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 15:53:48,570 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 15:53:48,571 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 15:53:48,571 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 15:53:48,571 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 15:53:48,571 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 15:53:48,571 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 15:53:48,571 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 15:53:48,571 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_59c847a1-2a8e-492d-9995-49e3c73da096/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 -> b8a667539b0a7850f9a7aa38ebbe1ead0e2c55d4 [2018-12-01 15:53:48,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 15:53:48,594 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 15:53:48,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 15:53:48,597 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 15:53:48,597 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 15:53:48,597 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-12-01 15:53:48,632 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/bin-2019/uautomizer/data/dbf0afc5e/bed9ff0d31a94aa39863f5f8579026aa/FLAG0898cc515 [2018-12-01 15:53:49,042 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 15:53:49,042 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-12-01 15:53:49,045 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/bin-2019/uautomizer/data/dbf0afc5e/bed9ff0d31a94aa39863f5f8579026aa/FLAG0898cc515 [2018-12-01 15:53:49,053 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/bin-2019/uautomizer/data/dbf0afc5e/bed9ff0d31a94aa39863f5f8579026aa [2018-12-01 15:53:49,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 15:53:49,056 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-01 15:53:49,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 15:53:49,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 15:53:49,059 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 15:53:49,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:53:49" (1/1) ... [2018-12-01 15:53:49,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56acabfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:53:49, skipping insertion in model container [2018-12-01 15:53:49,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:53:49" (1/1) ... [2018-12-01 15:53:49,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 15:53:49,074 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 15:53:49,164 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 15:53:49,173 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 15:53:49,184 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 15:53:49,196 INFO L195 MainTranslator]: Completed translation [2018-12-01 15:53:49,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:53:49 WrapperNode [2018-12-01 15:53:49,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 15:53:49,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 15:53:49,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 15:53:49,197 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 15:53:49,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:53:49" (1/1) ... [2018-12-01 15:53:49,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:53:49" (1/1) ... [2018-12-01 15:53:49,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:53:49" (1/1) ... [2018-12-01 15:53:49,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:53:49" (1/1) ... [2018-12-01 15:53:49,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:53:49" (1/1) ... [2018-12-01 15:53:49,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:53:49" (1/1) ... [2018-12-01 15:53:49,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:53:49" (1/1) ... [2018-12-01 15:53:49,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 15:53:49,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 15:53:49,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 15:53:49,251 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 15:53:49,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:53:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:53:49,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 15:53:49,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 15:53:49,283 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-12-01 15:53:49,283 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-12-01 15:53:49,284 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2018-12-01 15:53:49,284 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2018-12-01 15:53:49,284 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 15:53:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2018-12-01 15:53:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-12-01 15:53:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 15:53:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-12-01 15:53:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 15:53:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2018-12-01 15:53:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2018-12-01 15:53:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 15:53:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 15:53:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 15:53:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-01 15:53:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 15:53:49,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 15:53:49,466 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 15:53:49,466 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-01 15:53:49,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:53:49 BoogieIcfgContainer [2018-12-01 15:53:49,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 15:53:49,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 15:53:49,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 15:53:49,469 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 15:53:49,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:53:49" (1/3) ... [2018-12-01 15:53:49,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d60a8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:53:49, skipping insertion in model container [2018-12-01 15:53:49,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:53:49" (2/3) ... [2018-12-01 15:53:49,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d60a8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:53:49, skipping insertion in model container [2018-12-01 15:53:49,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:53:49" (3/3) ... [2018-12-01 15:53:49,471 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_true-valid-memsafety.c [2018-12-01 15:53:49,477 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 15:53:49,482 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-12-01 15:53:49,492 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-12-01 15:53:49,508 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 15:53:49,509 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 15:53:49,509 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-01 15:53:49,509 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 15:53:49,509 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 15:53:49,509 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 15:53:49,509 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 15:53:49,509 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 15:53:49,509 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 15:53:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-12-01 15:53:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-01 15:53:49,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:53:49,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:53:49,527 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:53:49,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:53:49,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468390, now seen corresponding path program 1 times [2018-12-01 15:53:49,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:53:49,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:53:49,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:49,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:53:49,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:49,648 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-01 15:53:49,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:53:49,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 15:53:49,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:53:49,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:53:49,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:53:49,662 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2018-12-01 15:53:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:53:49,695 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-12-01 15:53:49,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:53:49,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-01 15:53:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:53:49,702 INFO L225 Difference]: With dead ends: 68 [2018-12-01 15:53:49,702 INFO L226 Difference]: Without dead ends: 63 [2018-12-01 15:53:49,703 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-01 15:53:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-01 15:53:49,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-01 15:53:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-01 15:53:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-12-01 15:53:49,725 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 12 [2018-12-01 15:53:49,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:53:49,725 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-12-01 15:53:49,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:53:49,725 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-12-01 15:53:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-01 15:53:49,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:53:49,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:53:49,726 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:53:49,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:53:49,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468391, now seen corresponding path program 1 times [2018-12-01 15:53:49,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:53:49,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:53:49,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:49,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:53:49,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:49,797 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-01 15:53:49,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:53:49,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:53:49,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 15:53:49,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 15:53:49,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 15:53:49,798 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2018-12-01 15:53:49,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:53:49,859 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-12-01 15:53:49,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 15:53:49,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-01 15:53:49,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:53:49,860 INFO L225 Difference]: With dead ends: 66 [2018-12-01 15:53:49,860 INFO L226 Difference]: Without dead ends: 66 [2018-12-01 15:53:49,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 15:53:49,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-01 15:53:49,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-12-01 15:53:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-01 15:53:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-12-01 15:53:49,867 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2018-12-01 15:53:49,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:53:49,867 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-12-01 15:53:49,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 15:53:49,867 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-12-01 15:53:49,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 15:53:49,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:53:49,867 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:53:49,868 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:53:49,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:53:49,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1757784526, now seen corresponding path program 1 times [2018-12-01 15:53:49,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:53:49,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:53:49,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:49,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:53:49,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:49,970 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-01 15:53:49,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:53:49,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:53:49,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:53:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:50,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:53:50,035 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 63 treesize of output 56 [2018-12-01 15:53:50,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,070 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2018-12-01 15:53:50,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2018-12-01 15:53:50,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 76 [2018-12-01 15:53:50,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2018-12-01 15:53:50,291 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:50,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 52 [2018-12-01 15:53:50,331 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:50,376 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 15:53:50,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2018-12-01 15:53:50,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-01 15:53:50,447 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:50,458 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:50,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:50,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2018-12-01 15:53:50,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2018-12-01 15:53:50,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-01 15:53:50,558 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:50,567 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:50,578 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:50,604 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:50,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:50,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-01 15:53:50,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-01 15:53:50,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-01 15:53:50,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-01 15:53:50,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:50,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2018-12-01 15:53:50,641 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:50,659 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:50,666 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:50,671 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:50,676 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:50,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-01 15:53:50,693 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-01 15:53:50,765 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-01 15:53:50,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:53:50,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-12-01 15:53:50,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 15:53:50,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 15:53:50,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-01 15:53:50,790 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 8 states. [2018-12-01 15:53:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:53:50,900 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-12-01 15:53:50,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 15:53:50,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-01 15:53:50,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:53:50,901 INFO L225 Difference]: With dead ends: 69 [2018-12-01 15:53:50,902 INFO L226 Difference]: Without dead ends: 69 [2018-12-01 15:53:50,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-01 15:53:50,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-01 15:53:50,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-12-01 15:53:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-01 15:53:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-12-01 15:53:50,907 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2018-12-01 15:53:50,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:53:50,907 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-12-01 15:53:50,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 15:53:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-12-01 15:53:50,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 15:53:50,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:53:50,908 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:53:50,908 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:53:50,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:53:50,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1917592711, now seen corresponding path program 2 times [2018-12-01 15:53:50,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:53:50,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:53:50,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:50,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:53:50,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:53:51,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:53:51,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 15:53:51,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 15:53:51,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 15:53:51,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-01 15:53:51,112 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 8 states. [2018-12-01 15:53:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:53:51,156 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-12-01 15:53:51,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 15:53:51,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-01 15:53:51,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:53:51,157 INFO L225 Difference]: With dead ends: 68 [2018-12-01 15:53:51,157 INFO L226 Difference]: Without dead ends: 68 [2018-12-01 15:53:51,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-01 15:53:51,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-01 15:53:51,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-12-01 15:53:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-01 15:53:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-12-01 15:53:51,160 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 18 [2018-12-01 15:53:51,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:53:51,160 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-12-01 15:53:51,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 15:53:51,160 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-12-01 15:53:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 15:53:51,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:53:51,161 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:53:51,161 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:53:51,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:53:51,161 INFO L82 PathProgramCache]: Analyzing trace with hash 421781908, now seen corresponding path program 1 times [2018-12-01 15:53:51,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:53:51,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:53:51,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:51,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:53:51,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-01 15:53:51,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:53:51,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:53:51,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:53:51,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:53:51,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:53:51,185 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-12-01 15:53:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:53:51,242 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-12-01 15:53:51,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:53:51,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-01 15:53:51,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:53:51,243 INFO L225 Difference]: With dead ends: 65 [2018-12-01 15:53:51,243 INFO L226 Difference]: Without dead ends: 65 [2018-12-01 15:53:51,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-01 15:53:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-01 15:53:51,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-01 15:53:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-01 15:53:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-12-01 15:53:51,247 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 23 [2018-12-01 15:53:51,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:53:51,247 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-12-01 15:53:51,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:53:51,247 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-12-01 15:53:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 15:53:51,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:53:51,248 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:53:51,248 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:53:51,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:53:51,248 INFO L82 PathProgramCache]: Analyzing trace with hash 421781909, now seen corresponding path program 1 times [2018-12-01 15:53:51,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:53:51,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:53:51,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:51,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:53:51,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:51,291 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-01 15:53:51,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:53:51,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:53:51,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:53:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:51,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:53:51,323 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-01 15:53:51,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:53:51,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-01 15:53:51,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:53:51,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:53:51,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:53:51,339 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2018-12-01 15:53:51,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:53:51,352 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-12-01 15:53:51,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 15:53:51,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-01 15:53:51,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:53:51,353 INFO L225 Difference]: With dead ends: 70 [2018-12-01 15:53:51,353 INFO L226 Difference]: Without dead ends: 70 [2018-12-01 15:53:51,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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-01 15:53:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-01 15:53:51,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-12-01 15:53:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-01 15:53:51,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-12-01 15:53:51,357 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 23 [2018-12-01 15:53:51,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:53:51,358 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-12-01 15:53:51,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:53:51,358 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-12-01 15:53:51,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 15:53:51,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:53:51,359 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:53:51,359 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:53:51,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:53:51,359 INFO L82 PathProgramCache]: Analyzing trace with hash -16477362, now seen corresponding path program 2 times [2018-12-01 15:53:51,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:53:51,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:53:51,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:51,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:53:51,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:51,391 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-01 15:53:51,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:53:51,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:53:51,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 15:53:51,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-01 15:53:51,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 15:53:51,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:53:51,419 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 63 treesize of output 56 [2018-12-01 15:53:51,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,448 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2018-12-01 15:53:51,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2018-12-01 15:53:51,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 76 [2018-12-01 15:53:51,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-12-01 15:53:51,623 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:51,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 53 [2018-12-01 15:53:51,655 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:51,679 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:51,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2018-12-01 15:53:51,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-01 15:53:51,738 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:51,747 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:51,765 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:51,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2018-12-01 15:53:51,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2018-12-01 15:53:51,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-01 15:53:51,830 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:51,838 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:51,847 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:51,861 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:51,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:51,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-01 15:53:51,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-01 15:53:51,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-01 15:53:51,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-01 15:53:51,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:51,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2018-12-01 15:53:51,900 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:51,912 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:51,919 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:51,924 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:51,929 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:51,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-01 15:53:51,945 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-01 15:53:52,036 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-01 15:53:52,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 15:53:52,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2018-12-01 15:53:52,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 15:53:52,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 15:53:52,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-01 15:53:52,052 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 11 states. [2018-12-01 15:53:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:53:52,331 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-12-01 15:53:52,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 15:53:52,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-12-01 15:53:52,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:53:52,332 INFO L225 Difference]: With dead ends: 73 [2018-12-01 15:53:52,332 INFO L226 Difference]: Without dead ends: 73 [2018-12-01 15:53:52,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-12-01 15:53:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-01 15:53:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-12-01 15:53:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-01 15:53:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-12-01 15:53:52,334 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 26 [2018-12-01 15:53:52,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:53:52,334 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-12-01 15:53:52,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 15:53:52,334 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-12-01 15:53:52,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 15:53:52,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:53:52,335 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:53:52,335 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:53:52,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:53:52,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1612905533, now seen corresponding path program 1 times [2018-12-01 15:53:52,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:53:52,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:53:52,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:52,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:53:52,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:52,362 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-01 15:53:52,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:53:52,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:53:52,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:53:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:52,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:53:52,392 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-01 15:53:52,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:53:52,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-01 15:53:52,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 15:53:52,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 15:53:52,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-01 15:53:52,407 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 8 states. [2018-12-01 15:53:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:53:52,432 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-12-01 15:53:52,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 15:53:52,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-01 15:53:52,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:53:52,433 INFO L225 Difference]: With dead ends: 76 [2018-12-01 15:53:52,433 INFO L226 Difference]: Without dead ends: 76 [2018-12-01 15:53:52,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 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-01 15:53:52,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-01 15:53:52,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-12-01 15:53:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-01 15:53:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-12-01 15:53:52,437 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 30 [2018-12-01 15:53:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:53:52,437 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-12-01 15:53:52,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 15:53:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-12-01 15:53:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 15:53:52,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:53:52,438 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:53:52,438 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:53:52,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:53:52,438 INFO L82 PathProgramCache]: Analyzing trace with hash 532455402, now seen corresponding path program 2 times [2018-12-01 15:53:52,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:53:52,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:53:52,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:52,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:53:52,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:52,474 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-01 15:53:52,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:53:52,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:53:52,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 15:53:52,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-01 15:53:52,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 15:53:52,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:53:52,498 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 84 treesize of output 74 [2018-12-01 15:53:52,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,522 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 78 [2018-12-01 15:53:52,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2018-12-01 15:53:52,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 71 [2018-12-01 15:53:52,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2018-12-01 15:53:52,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2018-12-01 15:53:52,672 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:52,690 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:52,705 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:52,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:52,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 80 [2018-12-01 15:53:52,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 75 [2018-12-01 15:53:52,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2018-12-01 15:53:52,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2018-12-01 15:53:52,884 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:52,900 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:52,914 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:52,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:52,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 85 [2018-12-01 15:53:53,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 85 [2018-12-01 15:53:53,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2018-12-01 15:53:53,039 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:53,056 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:53,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 99 [2018-12-01 15:53:53,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2018-12-01 15:53:53,102 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:53,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:53,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 97 [2018-12-01 15:53:53,170 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-12-01 15:53:53,240 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 15:53:53,309 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-01 15:53:53,389 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-01 15:53:53,483 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-01 15:53:53,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-01 15:53:53,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-12-01 15:53:53,689 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:84, output treesize:405 [2018-12-01 15:53:53,867 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-01 15:53:53,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 15:53:53,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2018-12-01 15:53:53,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 15:53:53,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 15:53:53,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-01 15:53:53,883 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 9 states. [2018-12-01 15:53:54,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:53:54,294 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-12-01 15:53:54,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 15:53:54,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-12-01 15:53:54,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:53:54,295 INFO L225 Difference]: With dead ends: 78 [2018-12-01 15:53:54,295 INFO L226 Difference]: Without dead ends: 78 [2018-12-01 15:53:54,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-12-01 15:53:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-01 15:53:54,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-12-01 15:53:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-01 15:53:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-12-01 15:53:54,297 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 33 [2018-12-01 15:53:54,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:53:54,297 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-12-01 15:53:54,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 15:53:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-12-01 15:53:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-01 15:53:54,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:53:54,298 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:53:54,298 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:53:54,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:53:54,298 INFO L82 PathProgramCache]: Analyzing trace with hash -428261788, now seen corresponding path program 1 times [2018-12-01 15:53:54,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:53:54,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:53:54,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:54,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:53:54,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:54,332 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-01 15:53:54,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:53:54,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:53:54,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:53:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:54,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:53:54,358 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-01 15:53:54,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:53:54,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-01 15:53:54,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 15:53:54,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 15:53:54,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-01 15:53:54,374 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 10 states. [2018-12-01 15:53:54,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:53:54,397 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-12-01 15:53:54,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 15:53:54,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-12-01 15:53:54,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:53:54,398 INFO L225 Difference]: With dead ends: 81 [2018-12-01 15:53:54,398 INFO L226 Difference]: Without dead ends: 81 [2018-12-01 15:53:54,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 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-01 15:53:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-01 15:53:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-12-01 15:53:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-01 15:53:54,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-12-01 15:53:54,400 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 36 [2018-12-01 15:53:54,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:53:54,401 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-12-01 15:53:54,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 15:53:54,401 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-12-01 15:53:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-01 15:53:54,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:53:54,401 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:53:54,401 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:53:54,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:53:54,401 INFO L82 PathProgramCache]: Analyzing trace with hash 507961675, now seen corresponding path program 2 times [2018-12-01 15:53:54,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:53:54,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:53:54,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:54,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:53:54,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:54,441 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-01 15:53:54,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:53:54,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:53:54,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 15:53:54,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-01 15:53:54,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 15:53:54,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:53:54,464 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 18 treesize of output 21 [2018-12-01 15:53:54,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-01 15:53:54,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-01 15:53:54,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-01 15:53:54,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2018-12-01 15:53:54,484 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:54,499 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:54,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:54,516 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:54,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:54,535 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 63 treesize of output 56 [2018-12-01 15:53:54,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,549 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2018-12-01 15:53:54,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2018-12-01 15:53:54,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 76 [2018-12-01 15:53:54,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-12-01 15:53:54,712 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:54,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2018-12-01 15:53:54,755 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:54,781 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 15:53:54,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2018-12-01 15:53:54,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-01 15:53:54,837 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:54,845 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:54,854 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:54,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2018-12-01 15:53:54,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2018-12-01 15:53:54,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:54,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-01 15:53:54,913 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:54,921 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:54,926 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:54,934 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:54,939 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:54,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-01 15:53:54,950 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-01 15:53:55,052 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-01 15:53:55,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 15:53:55,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2018-12-01 15:53:55,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 15:53:55,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 15:53:55,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-12-01 15:53:55,068 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 13 states. [2018-12-01 15:53:55,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:53:55,264 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-12-01 15:53:55,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 15:53:55,264 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-12-01 15:53:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:53:55,265 INFO L225 Difference]: With dead ends: 83 [2018-12-01 15:53:55,265 INFO L226 Difference]: Without dead ends: 83 [2018-12-01 15:53:55,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2018-12-01 15:53:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-01 15:53:55,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-12-01 15:53:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-01 15:53:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-12-01 15:53:55,268 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 39 [2018-12-01 15:53:55,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:53:55,268 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-12-01 15:53:55,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 15:53:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-12-01 15:53:55,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-01 15:53:55,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:53:55,269 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, 1, 1, 1] [2018-12-01 15:53:55,270 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:53:55,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:53:55,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1242834180, now seen corresponding path program 1 times [2018-12-01 15:53:55,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:53:55,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:53:55,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:55,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:53:55,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-01 15:53:55,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:53:55,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:53:55,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:53:55,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:53:55,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:53:55,299 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 6 states. [2018-12-01 15:53:55,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:53:55,355 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-12-01 15:53:55,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:53:55,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-12-01 15:53:55,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:53:55,356 INFO L225 Difference]: With dead ends: 80 [2018-12-01 15:53:55,356 INFO L226 Difference]: Without dead ends: 80 [2018-12-01 15:53:55,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-01 15:53:55,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-01 15:53:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-01 15:53:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-01 15:53:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-12-01 15:53:55,358 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 51 [2018-12-01 15:53:55,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:53:55,358 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-12-01 15:53:55,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:53:55,358 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-12-01 15:53:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-01 15:53:55,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:53:55,359 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, 1, 1, 1] [2018-12-01 15:53:55,359 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:53:55,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:53:55,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1242834181, now seen corresponding path program 1 times [2018-12-01 15:53:55,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:53:55,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:53:55,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:55,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:53:55,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:55,418 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-01 15:53:55,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:53:55,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:53:55,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:53:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:55,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:53:55,452 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-01 15:53:55,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:53:55,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-12-01 15:53:55,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 15:53:55,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 15:53:55,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-01 15:53:55,468 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 12 states. [2018-12-01 15:53:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:53:55,491 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-12-01 15:53:55,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 15:53:55,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-12-01 15:53:55,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:53:55,492 INFO L225 Difference]: With dead ends: 85 [2018-12-01 15:53:55,492 INFO L226 Difference]: Without dead ends: 85 [2018-12-01 15:53:55,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 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-01 15:53:55,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-01 15:53:55,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-12-01 15:53:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-01 15:53:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-12-01 15:53:55,495 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 51 [2018-12-01 15:53:55,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:53:55,495 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-12-01 15:53:55,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 15:53:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-12-01 15:53:55,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-01 15:53:55,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:53:55,496 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, 1, 1, 1] [2018-12-01 15:53:55,496 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:53:55,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:53:55,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1213368514, now seen corresponding path program 2 times [2018-12-01 15:53:55,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:53:55,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:53:55,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:55,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:53:55,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:55,578 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-01 15:53:55,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:53:55,578 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:53:55,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 15:53:55,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-01 15:53:55,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 15:53:55,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:53:55,604 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 18 treesize of output 21 [2018-12-01 15:53:55,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,607 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-01 15:53:55,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-01 15:53:55,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-01 15:53:55,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2018-12-01 15:53:55,623 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:55,639 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:55,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:55,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:55,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:55,681 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 63 treesize of output 56 [2018-12-01 15:53:55,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,694 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2018-12-01 15:53:55,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2018-12-01 15:53:55,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 76 [2018-12-01 15:53:55,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2018-12-01 15:53:55,869 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:55,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-12-01 15:53:55,897 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:55,910 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:55,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2018-12-01 15:53:55,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:55,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-01 15:53:55,963 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:55,973 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:55,984 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:56,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2018-12-01 15:53:56,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2018-12-01 15:53:56,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-01 15:53:56,045 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:56,052 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:56,057 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:56,065 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:56,070 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:56,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-01 15:53:56,080 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-01 15:53:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-12-01 15:53:56,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 15:53:56,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2018-12-01 15:53:56,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-01 15:53:56,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-01 15:53:56,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-12-01 15:53:56,234 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 17 states. [2018-12-01 15:53:56,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:53:56,638 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-12-01 15:53:56,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-01 15:53:56,638 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-12-01 15:53:56,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:53:56,639 INFO L225 Difference]: With dead ends: 86 [2018-12-01 15:53:56,639 INFO L226 Difference]: Without dead ends: 86 [2018-12-01 15:53:56,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2018-12-01 15:53:56,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-01 15:53:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-01 15:53:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-01 15:53:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-12-01 15:53:56,642 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 54 [2018-12-01 15:53:56,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:53:56,642 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-12-01 15:53:56,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-01 15:53:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-12-01 15:53:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-01 15:53:56,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:53:56,643 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, 1, 1, 1, 1] [2018-12-01 15:53:56,643 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:53:56,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:53:56,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1111163333, now seen corresponding path program 1 times [2018-12-01 15:53:56,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:53:56,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:53:56,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:56,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:53:56,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:56,662 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-01 15:53:56,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:53:56,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:53:56,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:53:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:56,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:53:56,698 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-01 15:53:56,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:53:56,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-01 15:53:56,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:53:56,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:53:56,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:53:56,715 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 5 states. [2018-12-01 15:53:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:53:56,724 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-12-01 15:53:56,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 15:53:56,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-12-01 15:53:56,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:53:56,724 INFO L225 Difference]: With dead ends: 95 [2018-12-01 15:53:56,724 INFO L226 Difference]: Without dead ends: 95 [2018-12-01 15:53:56,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:53:56,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-01 15:53:56,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2018-12-01 15:53:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-01 15:53:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-12-01 15:53:56,726 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 58 [2018-12-01 15:53:56,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:53:56,726 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-12-01 15:53:56,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:53:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-12-01 15:53:56,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-01 15:53:56,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:53:56,727 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, 1, 1, 1, 1] [2018-12-01 15:53:56,727 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:53:56,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:53:56,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1242768695, now seen corresponding path program 2 times [2018-12-01 15:53:56,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:53:56,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:53:56,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:56,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:53:56,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:53:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:53:56,747 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-01 15:53:56,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:53:56,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:53:56,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 15:53:56,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-01 15:53:56,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 15:53:56,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:53:56,772 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 84 treesize of output 74 [2018-12-01 15:53:56,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,798 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 78 [2018-12-01 15:53:56,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 80 [2018-12-01 15:53:56,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 75 [2018-12-01 15:53:56,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:56,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2018-12-01 15:53:56,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2018-12-01 15:53:56,975 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:56,989 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:57,003 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:57,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 85 [2018-12-01 15:53:57,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 85 [2018-12-01 15:53:57,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2018-12-01 15:53:57,149 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:57,166 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:57,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 99 [2018-12-01 15:53:57,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2018-12-01 15:53:57,216 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:57,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 97 [2018-12-01 15:53:57,275 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-01 15:53:57,341 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 15:53:57,406 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-01 15:53:57,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-01 15:53:57,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2018-12-01 15:53:57,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 71 [2018-12-01 15:53:57,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:53:57,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2018-12-01 15:53:57,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2018-12-01 15:53:57,665 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 15:53:57,681 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:57,698 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:57,717 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:53:57,813 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-01 15:53:57,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-01 15:53:58,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-12-01 15:53:58,006 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:84, output treesize:405 [2018-12-01 15:53:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-01 15:53:58,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 15:53:58,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2018-12-01 15:53:58,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:53:58,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:53:58,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:53:58,280 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 6 states. [2018-12-01 15:54:00,413 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 116 [2018-12-01 15:54:00,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:54:00,452 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-12-01 15:54:00,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:54:00,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-01 15:54:00,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:54:00,453 INFO L225 Difference]: With dead ends: 99 [2018-12-01 15:54:00,453 INFO L226 Difference]: Without dead ends: 99 [2018-12-01 15:54:00,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-01 15:54:00,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-01 15:54:00,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-12-01 15:54:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-01 15:54:00,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-12-01 15:54:00,455 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 63 [2018-12-01 15:54:00,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:54:00,455 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-12-01 15:54:00,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:54:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-12-01 15:54:00,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-01 15:54:00,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:54:00,456 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, 1, 1, 1, 1] [2018-12-01 15:54:00,456 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:54:00,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:00,456 INFO L82 PathProgramCache]: Analyzing trace with hash 446605052, now seen corresponding path program 1 times [2018-12-01 15:54:00,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:00,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:00,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:00,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:54:00,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:00,484 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-01 15:54:00,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:54:00,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:54:00,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:00,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:54:00,519 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-01 15:54:00,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:54:00,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-01 15:54:00,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 15:54:00,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 15:54:00,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:54:00,534 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 7 states. [2018-12-01 15:54:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:54:00,550 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-12-01 15:54:00,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:54:00,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-12-01 15:54:00,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:54:00,551 INFO L225 Difference]: With dead ends: 104 [2018-12-01 15:54:00,551 INFO L226 Difference]: Without dead ends: 104 [2018-12-01 15:54:00,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 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-01 15:54:00,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-01 15:54:00,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2018-12-01 15:54:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-01 15:54:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-12-01 15:54:00,554 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 68 [2018-12-01 15:54:00,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:54:00,554 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-12-01 15:54:00,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 15:54:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-12-01 15:54:00,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-01 15:54:00,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:54:00,555 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, 1, 1, 1, 1] [2018-12-01 15:54:00,555 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:54:00,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:00,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1853794826, now seen corresponding path program 2 times [2018-12-01 15:54:00,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:00,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:00,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:00,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:00,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:00,582 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-01 15:54:00,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:54:00,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:54:00,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 15:54:00,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-01 15:54:00,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 15:54:00,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:54:00,611 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 63 treesize of output 56 [2018-12-01 15:54:00,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,638 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2018-12-01 15:54:00,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2018-12-01 15:54:00,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 66 [2018-12-01 15:54:00,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-12-01 15:54:00,766 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:00,778 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:00,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 76 [2018-12-01 15:54:00,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2018-12-01 15:54:00,876 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:00,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 52 [2018-12-01 15:54:00,905 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:00,933 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 15:54:00,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 15:54:00,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:00,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2018-12-01 15:54:01,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2018-12-01 15:54:01,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-01 15:54:01,029 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,037 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,046 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,069 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-01 15:54:01,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-01 15:54:01,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-01 15:54:01,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-01 15:54:01,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2018-12-01 15:54:01,101 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,120 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,129 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,135 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,140 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-01 15:54:01,155 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-01 15:54:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-12-01 15:54:01,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 15:54:01,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2018-12-01 15:54:01,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 15:54:01,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 15:54:01,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-01 15:54:01,307 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 10 states. [2018-12-01 15:54:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:54:01,474 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-12-01 15:54:01,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 15:54:01,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-12-01 15:54:01,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:54:01,475 INFO L225 Difference]: With dead ends: 108 [2018-12-01 15:54:01,475 INFO L226 Difference]: Without dead ends: 108 [2018-12-01 15:54:01,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-12-01 15:54:01,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-01 15:54:01,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2018-12-01 15:54:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-01 15:54:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-12-01 15:54:01,478 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 73 [2018-12-01 15:54:01,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:54:01,478 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-12-01 15:54:01,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 15:54:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-12-01 15:54:01,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-01 15:54:01,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:54:01,478 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:54:01,478 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:54:01,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:01,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1594057848, now seen corresponding path program 1 times [2018-12-01 15:54:01,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:01,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:01,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:01,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:54:01,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-12-01 15:54:01,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:54:01,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:54:01,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:54:01,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:54:01,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:54:01,511 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 6 states. [2018-12-01 15:54:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:54:01,561 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-12-01 15:54:01,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:54:01,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-12-01 15:54:01,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:54:01,562 INFO L225 Difference]: With dead ends: 103 [2018-12-01 15:54:01,562 INFO L226 Difference]: Without dead ends: 103 [2018-12-01 15:54:01,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-01 15:54:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-01 15:54:01,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-01 15:54:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-01 15:54:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-12-01 15:54:01,565 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 87 [2018-12-01 15:54:01,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:54:01,565 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-12-01 15:54:01,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:54:01,565 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-12-01 15:54:01,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-01 15:54:01,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:54:01,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:54:01,566 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:54:01,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:01,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1594057847, now seen corresponding path program 1 times [2018-12-01 15:54:01,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:01,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:01,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:01,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:01,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-01 15:54:01,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:54:01,602 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:54:01,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:01,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:54:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-01 15:54:01,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:54:01,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-01 15:54:01,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 15:54:01,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 15:54:01,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-01 15:54:01,661 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 9 states. [2018-12-01 15:54:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:54:01,688 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-12-01 15:54:01,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 15:54:01,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-12-01 15:54:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:54:01,689 INFO L225 Difference]: With dead ends: 112 [2018-12-01 15:54:01,689 INFO L226 Difference]: Without dead ends: 112 [2018-12-01 15:54:01,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 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-01 15:54:01,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-01 15:54:01,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-12-01 15:54:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-01 15:54:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-12-01 15:54:01,692 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 87 [2018-12-01 15:54:01,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:54:01,692 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-12-01 15:54:01,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 15:54:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-12-01 15:54:01,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-01 15:54:01,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:54:01,693 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:54:01,693 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:54:01,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:01,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1854312005, now seen corresponding path program 2 times [2018-12-01 15:54:01,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:01,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:01,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:01,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:01,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-01 15:54:01,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:54:01,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:54:01,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 15:54:01,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-01 15:54:01,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 15:54:01,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:54:01,778 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 18 treesize of output 21 [2018-12-01 15:54:01,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,780 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-01 15:54:01,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2018-12-01 15:54:01,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 43 [2018-12-01 15:54:01,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 64 [2018-12-01 15:54:01,794 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,810 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-12-01 15:54:01,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,861 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 55 [2018-12-01 15:54:01,863 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-12-01 15:54:01,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 51 [2018-12-01 15:54:01,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-12-01 15:54:01,914 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,921 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,925 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:01,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,943 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 53 [2018-12-01 15:54:01,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:01,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 68 [2018-12-01 15:54:02,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 56 [2018-12-01 15:54:02,035 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2018-12-01 15:54:02,064 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,080 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 15:54:02,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 55 [2018-12-01 15:54:02,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 33 [2018-12-01 15:54:02,122 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,132 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,140 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,147 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,151 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-01 15:54:02,161 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:70, output treesize:45 [2018-12-01 15:54:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-12-01 15:54:02,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 15:54:02,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2018-12-01 15:54:02,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-01 15:54:02,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-01 15:54:02,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-12-01 15:54:02,373 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 14 states. [2018-12-01 15:54:02,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:54:02,710 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-12-01 15:54:02,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 15:54:02,710 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 92 [2018-12-01 15:54:02,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:54:02,711 INFO L225 Difference]: With dead ends: 117 [2018-12-01 15:54:02,711 INFO L226 Difference]: Without dead ends: 117 [2018-12-01 15:54:02,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2018-12-01 15:54:02,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-01 15:54:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-12-01 15:54:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-01 15:54:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-12-01 15:54:02,713 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 92 [2018-12-01 15:54:02,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:54:02,713 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-12-01 15:54:02,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-01 15:54:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-12-01 15:54:02,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-01 15:54:02,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:54:02,714 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:54:02,714 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:54:02,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:02,714 INFO L82 PathProgramCache]: Analyzing trace with hash 196128295, now seen corresponding path program 1 times [2018-12-01 15:54:02,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:02,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:02,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:02,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:54:02,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-01 15:54:02,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:54:02,762 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:54:02,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:02,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:54:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-01 15:54:02,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:54:02,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-12-01 15:54:02,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 15:54:02,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 15:54:02,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-01 15:54:02,815 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 11 states. [2018-12-01 15:54:02,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:54:02,855 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2018-12-01 15:54:02,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 15:54:02,855 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-12-01 15:54:02,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:54:02,856 INFO L225 Difference]: With dead ends: 122 [2018-12-01 15:54:02,856 INFO L226 Difference]: Without dead ends: 122 [2018-12-01 15:54:02,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 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-01 15:54:02,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-01 15:54:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2018-12-01 15:54:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-01 15:54:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2018-12-01 15:54:02,859 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 98 [2018-12-01 15:54:02,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:54:02,859 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2018-12-01 15:54:02,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 15:54:02,859 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2018-12-01 15:54:02,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-01 15:54:02,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:54:02,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:54:02,860 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:54:02,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:02,860 INFO L82 PathProgramCache]: Analyzing trace with hash 916743349, now seen corresponding path program 2 times [2018-12-01 15:54:02,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:02,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:02,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:02,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:02,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-01 15:54:02,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:54:02,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:54:02,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 15:54:02,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-01 15:54:02,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 15:54:02,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:54:02,952 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 21 treesize of output 24 [2018-12-01 15:54:02,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,967 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2018-12-01 15:54:02,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,979 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-12-01 15:54:02,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,991 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2018-12-01 15:54:02,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2018-12-01 15:54:03,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2018-12-01 15:54:03,003 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:03,013 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:03,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 48 [2018-12-01 15:54:03,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 51 [2018-12-01 15:54:03,058 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-01 15:54:03,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 53 [2018-12-01 15:54:03,093 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:03,125 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 15:54:03,155 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-01 15:54:03,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-12-01 15:54:03,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-12-01 15:54:03,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-12-01 15:54:03,206 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:03,211 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:03,217 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:03,250 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-01 15:54:03,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2018-12-01 15:54:03,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-12-01 15:54:03,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-12-01 15:54:03,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-12-01 15:54:03,306 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:03,310 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:03,315 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:03,319 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:03,355 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-01 15:54:03,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-01 15:54:03,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-12-01 15:54:03,422 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:21, output treesize:165 [2018-12-01 15:54:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-12-01 15:54:03,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 15:54:03,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 12 [2018-12-01 15:54:03,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 15:54:03,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 15:54:03,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-12-01 15:54:03,507 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand 12 states. [2018-12-01 15:54:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:54:03,636 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-12-01 15:54:03,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 15:54:03,636 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2018-12-01 15:54:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:54:03,637 INFO L225 Difference]: With dead ends: 126 [2018-12-01 15:54:03,637 INFO L226 Difference]: Without dead ends: 126 [2018-12-01 15:54:03,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2018-12-01 15:54:03,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-01 15:54:03,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2018-12-01 15:54:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-01 15:54:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-12-01 15:54:03,640 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 103 [2018-12-01 15:54:03,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:54:03,640 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-12-01 15:54:03,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 15:54:03,640 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-12-01 15:54:03,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-01 15:54:03,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:54:03,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:54:03,641 INFO L423 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:54:03,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:03,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1877120744, now seen corresponding path program 1 times [2018-12-01 15:54:03,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:03,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:03,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:03,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:54:03,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-01 15:54:03,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:54:03,701 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/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-01 15:54:03,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:03,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:54:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-01 15:54:03,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:54:03,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-01 15:54:03,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 15:54:03,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 15:54:03,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-01 15:54:03,771 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 13 states. [2018-12-01 15:54:03,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:54:03,805 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-12-01 15:54:03,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 15:54:03,805 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2018-12-01 15:54:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:54:03,806 INFO L225 Difference]: With dead ends: 127 [2018-12-01 15:54:03,806 INFO L226 Difference]: Without dead ends: 127 [2018-12-01 15:54:03,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 108 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-01 15:54:03,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-01 15:54:03,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-01 15:54:03,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-01 15:54:03,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-12-01 15:54:03,808 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 108 [2018-12-01 15:54:03,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:54:03,808 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-12-01 15:54:03,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 15:54:03,808 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-12-01 15:54:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-01 15:54:03,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:54:03,808 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:54:03,808 INFO L423 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:54:03,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:03,809 INFO L82 PathProgramCache]: Analyzing trace with hash -184159242, now seen corresponding path program 2 times [2018-12-01 15:54:03,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:03,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:03,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:03,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:03,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-01 15:54:03,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:54:03,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 15:54:03,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 15:54:03,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-01 15:54:03,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 15:54:03,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:54:03,864 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 18 treesize of output 21 [2018-12-01 15:54:03,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,867 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-01 15:54:03,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-01 15:54:03,876 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2018-12-01 15:54:03,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 60 [2018-12-01 15:54:03,884 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:03,896 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:03,909 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:03,915 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:03,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:03,931 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 46 treesize of output 42 [2018-12-01 15:54:03,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,944 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 52 [2018-12-01 15:54:03,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:03,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 60 [2018-12-01 15:54:03,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 59 [2018-12-01 15:54:04,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-12-01 15:54:04,035 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-12-01 15:54:04,057 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,065 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 46 [2018-12-01 15:54:04,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-01 15:54:04,102 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,107 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,113 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-12-01 15:54:04,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 42 [2018-12-01 15:54:04,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-01 15:54:04,143 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,144 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,148 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,152 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,155 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-01 15:54:04,162 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2018-12-01 15:54:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-12-01 15:54:04,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 15:54:04,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2018-12-01 15:54:04,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 15:54:04,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 15:54:04,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:54:04,303 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 7 states. [2018-12-01 15:54:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:54:04,388 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-12-01 15:54:04,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 15:54:04,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-01 15:54:04,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:54:04,389 INFO L225 Difference]: With dead ends: 135 [2018-12-01 15:54:04,389 INFO L226 Difference]: Without dead ends: 135 [2018-12-01 15:54:04,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-01 15:54:04,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-01 15:54:04,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2018-12-01 15:54:04,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-01 15:54:04,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-12-01 15:54:04,392 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 113 [2018-12-01 15:54:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:54:04,392 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-12-01 15:54:04,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 15:54:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-12-01 15:54:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-01 15:54:04,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:54:04,393 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:54:04,393 INFO L423 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:54:04,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:04,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1533212022, now seen corresponding path program 1 times [2018-12-01 15:54:04,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:04,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:04,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:04,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:54:04,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-12-01 15:54:04,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:54:04,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:54:04,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:54:04,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:54:04,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:54:04,437 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 6 states. [2018-12-01 15:54:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:54:04,475 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-12-01 15:54:04,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:54:04,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-12-01 15:54:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:54:04,476 INFO L225 Difference]: With dead ends: 130 [2018-12-01 15:54:04,476 INFO L226 Difference]: Without dead ends: 130 [2018-12-01 15:54:04,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-01 15:54:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-01 15:54:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-01 15:54:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-01 15:54:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2018-12-01 15:54:04,478 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 127 [2018-12-01 15:54:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:54:04,478 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2018-12-01 15:54:04,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:54:04,478 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2018-12-01 15:54:04,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-01 15:54:04,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:54:04,478 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:54:04,478 INFO L423 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:54:04,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:04,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1533212021, now seen corresponding path program 1 times [2018-12-01 15:54:04,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:04,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:04,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:04,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:04,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-12-01 15:54:04,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:54:04,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 15:54:04,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:04,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:54:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-12-01 15:54:04,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:54:04,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-01 15:54:04,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:54:04,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:54:04,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:54:04,574 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand 6 states. [2018-12-01 15:54:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:54:04,587 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-12-01 15:54:04,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 15:54:04,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-12-01 15:54:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:54:04,587 INFO L225 Difference]: With dead ends: 139 [2018-12-01 15:54:04,588 INFO L226 Difference]: Without dead ends: 139 [2018-12-01 15:54:04,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 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-01 15:54:04,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-01 15:54:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-12-01 15:54:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-01 15:54:04,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-12-01 15:54:04,590 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 127 [2018-12-01 15:54:04,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:54:04,590 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-12-01 15:54:04,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:54:04,590 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-12-01 15:54:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-01 15:54:04,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:54:04,590 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:54:04,590 INFO L423 AbstractCegarLoop]: === Iteration 28 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-01 15:54:04,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:04,591 INFO L82 PathProgramCache]: Analyzing trace with hash 82106357, now seen corresponding path program 2 times [2018-12-01 15:54:04,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:04,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:04,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:04,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:04,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-12-01 15:54:04,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:54:04,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 15:54:04,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 15:54:04,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-01 15:54:04,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 15:54:04,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:54:04,655 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 18 treesize of output 21 [2018-12-01 15:54:04,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,659 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-01 15:54:04,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-01 15:54:04,671 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2018-12-01 15:54:04,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 60 [2018-12-01 15:54:04,678 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,692 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,712 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,727 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 46 treesize of output 42 [2018-12-01 15:54:04,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,739 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 52 [2018-12-01 15:54:04,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 60 [2018-12-01 15:54:04,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 59 [2018-12-01 15:54:04,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2018-12-01 15:54:04,828 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-12-01 15:54:04,850 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,862 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 15:54:04,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 46 [2018-12-01 15:54:04,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-01 15:54:04,899 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,906 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,911 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-12-01 15:54:04,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 42 [2018-12-01 15:54:04,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:04,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-01 15:54:04,942 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,943 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,947 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,951 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,955 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:04,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-01 15:54:04,963 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2018-12-01 15:54:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2018-12-01 15:54:05,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 15:54:05,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2018-12-01 15:54:05,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 15:54:05,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 15:54:05,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-01 15:54:05,159 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 11 states. [2018-12-01 15:54:05,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:54:05,373 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2018-12-01 15:54:05,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 15:54:05,373 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 132 [2018-12-01 15:54:05,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:54:05,373 INFO L225 Difference]: With dead ends: 144 [2018-12-01 15:54:05,373 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 15:54:05,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-12-01 15:54:05,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 15:54:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 15:54:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 15:54:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 15:54:05,374 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2018-12-01 15:54:05,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:54:05,374 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 15:54:05,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 15:54:05,374 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 15:54:05,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 15:54:05,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:54:05 BoogieIcfgContainer [2018-12-01 15:54:05,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 15:54:05,377 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 15:54:05,377 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 15:54:05,377 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 15:54:05,378 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:53:49" (3/4) ... [2018-12-01 15:54:05,380 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 15:54:05,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 15:54:05,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers3 [2018-12-01 15:54:05,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers2 [2018-12-01 15:54:05,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers4 [2018-12-01 15:54:05,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 15:54:05,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2018-12-01 15:54:05,389 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-12-01 15:54:05,389 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-12-01 15:54:05,389 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-01 15:54:05,389 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-01 15:54:05,413 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_59c847a1-2a8e-492d-9995-49e3c73da096/bin-2019/uautomizer/witness.graphml [2018-12-01 15:54:05,413 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 15:54:05,413 INFO L168 Benchmark]: Toolchain (without parser) took 16357.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.2 MB). Free memory was 957.1 MB in the beginning and 1.3 GB in the end (delta: -343.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 15:54:05,414 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 15:54:05,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.18 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 945.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-01 15:54:05,414 INFO L168 Benchmark]: Boogie Preprocessor took 53.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.7 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -133.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-12-01 15:54:05,414 INFO L168 Benchmark]: RCFGBuilder took 216.05 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-12-01 15:54:05,414 INFO L168 Benchmark]: TraceAbstraction took 15909.72 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 236.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -250.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 15:54:05,414 INFO L168 Benchmark]: Witness Printer took 35.80 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 71.8 kB). Peak memory consumption was 71.8 kB. Max. memory is 11.5 GB. [2018-12-01 15:54:05,415 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 140.18 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 945.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.7 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -133.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 216.05 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15909.72 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 236.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -250.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 35.80 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 71.8 kB). Peak memory consumption was 71.8 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 70 locations, 17 error locations. SAFE Result, 15.8s OverallTime, 28 OverallIterations, 10 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1352 SDtfs, 1215 SDslu, 5695 SDs, 0 SdLazy, 2405 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1683 GetRequests, 1416 SyntacticMatches, 1 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=27, 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, 28 MinimizatonAttempts, 58 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 3188 NumberOfCodeBlocks, 2696 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3139 ConstructedInterpolants, 620 QuantifiedInterpolants, 3837226 SizeOfPredicates, 62 NumberOfNonLiveVariables, 4532 ConjunctsInSsa, 245 ConjunctsInUnsatCore, 49 InterpolantComputations, 17 PerfectInterpolantSequences, 6125/7756 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...